Search results for "Graph theory"

Products of groups with finite rank

1987

On 2-groups with no abelian subgroups of rank four

1975

Orientation matters

2008

The optimal communication spanning tree (OCST) problem is a well known $\mathcal{NP}$-hard combinatorial optimization problem which seeks a spanning tree that satisfies all given communication requirements for minimal total costs. It has been shown that optimal solutions of OCST problems are biased towards the much simpler minimum spanning tree (MST) problem. Therefore, problem-specific representations for EAs like heuristic variants of edge-sets that are biased towards MSTs show high performance.In this paper, additional properties of optimal solutions for Euclidean variants of OCST problems are studied. Experimental results show that not only edges in optimal trees are biased towards low-…

Lengths of radii under conformal maps of the unit disc

1999

If E f ( R ) E_{f}(R) is the set of endpoints of radii which have length greater than or equal to R > 0 R>0 under a conformal map f f of the unit disc, then cap ⁡ E f ( R ) = O ( R − 1 / 2 ) \operatorname {cap} E_{f}(R)=O(R^{-1/2}) as R → ∞ R\to \infty for the logarithmic capacity of E f ( R ) E_{f}(R) . The exponent − 1 / 2 -1/2 is sharp.

Quasi-Modes in Higher Dimension

2019

Recall that if a(x, ξ) and b(x, ξ) are two C1-functions defined on some domain in \({\mathbf {R}}^{2n}_{x,\xi }\), then we can define the Poisson bracket to be the C0-function on the same domain given by $$\displaystyle \{ a,b\} =a^{\prime }_\xi \cdot b^{\prime }_x-a^{\prime }_x \cdot b^{\prime }_\xi =H_a(b). $$ Here \(H_a=a^{\prime }_\xi \cdot \partial _x-a^{\prime }_x\cdot \partial _\xi \) denotes the Hamilton vector field of a. The following result is due to Zworski, who obtained it via a semi-classical reduction from the above mentioned result of Hormander. A direct proof was given in Dencker et al. and here we give a variant. We will assume some familiarity with symplectic geometry.

Historical Notes on Star Geometry in Mathematics, Art and Nature

2018

Gamma: “I can. Look at this Counterexample 3: a star-polyhedron I shall call it urchin. This consists of 12 star-pentagons. It has 12 vertices, 30 edges, and 12 pentagonal faces-you may check it if you like by counting. Thus the Descartes-Euler thesis is not true at all, since for this polyhedron \(V - E + F = - 6\)”. Delta: “Why do you think that your ‘urchin’ is a polyhedron?” Gamma: “Do you not see? This is a polyhedron, whose faces are the twelve star-pentagons”. Delta: “But then you do not even know what a polygon is! A star-pentagon is certainly not a polygon!”

A variation on theorems of Jordan and Gluck

2006

Abstract Gluck proved that any finite group G has an abelian subgroup A such that | G : A | is bounded by a polynomial function of the largest degree of the complex irreducible characters of G . This improved on a previous bound of Isaacs and Passman. In this paper, we present a variation of this result that looks at the number of prime factors. All these results, in turn, may be seen as variations on the classical theorem of Jordan on linear groups.

A code to evaluate prolate and oblate spheroidal harmonics

1998

Abstract We present a code to evaluate prolate ( P n m ( x ), Q n m ( x ); n ≥ m , x > 1) and oblate ( P n m ( ix ), Q n m ( ix ); n ≥ m , x > 0) spheroidal harmonics, that is, spherical harmonics ( n and m integers) for real arguments larger than one and for purely imaginary arguments. We start from the known values (in closed form) of P m m and P m +1 m and we apply the forward recurrence relation over n up to a given degree n = N Max . The Wronskian relating P 's and Q 's, together with the evaluation of the continued fraction for Q m+N staggeredMax m / Q m+N staggeredMax -1 m , allows the calculation of Q m+N staggeredMax m and Q m+N staggeredMax -1 m . Backward recurrence is then appli…

An algorithm for the Rural Postman problem on a directed graph

1986

The Directed Rural Postman Problem (DRPP) is a general case of the Chinese Postman Problem where a subset of the set of arcs of a given directed graph is ‘required’ to be traversed at minimum cost. If this subset does not form a weakly connected graph but forms a number of disconnected components the problem is NP-Complete, and is also a generalization of the asymmetric Travelling Salesman Problem. In this paper we present a branch and bound algorithm for the exact solution of the DRPP based on bounds computed from Lagrangean Relaxation (with shortest spanning arborescence sub-problems) and on the fathoming of some of the tree nodes by the solution of minimum cost flow problems. Computation…

EXISTENCE OF THREE SOLUTIONS FOR A MIXED BOUNDARY VALUE PROBLEM WITH THE STURM-LIOUVILLE EQUATION

2012

Abstract. The aim of this paper is to establish the existence of threesolutions for a Sturm-Liouville mixed boundary value problem. The ap-proach is based on multiple critical points theorems. 1. IntroductionThe aim of this paper is to establish, under a suitable set of assumptions, theexistence of at least three solutions for the following Sturm-Liouville problemwith mixed boundary conditions(RS λ )ˆ−(pu ′ ) ′ +qu = λf(t,u) in I =]a,b[u(a) = u ′ (b) = 0,where λ is a positive parameter and p, q, f are regular functions. To be precise,if f : [a,b] × R→ Ris a L 2 -Carath´eodory function and p,q ∈ L ∞ ([a,b]) suchthatp 0 := essinf t∈[a,b] p(t) > 0, q 0 := essinf t∈[a,b] q(t) ≥ 0,then we prove …