Quasi-conformal mapping theorem and bifurcations

LetH be a germ of holomorphic diffeomorphism at 0 . Using the existence theorem for quasi-conformal mappings, it is possible to prove that there exists a multivalued germS at 0, such thatS(ze ²ⁱ )=HS(z) (1). IfH is an unfolding of diffeomorphisms depending on (,0), withH ₀=Id, one introduces its ideal . It is the ideal generated by the germs of coefficients (a _i (), 0) at 0 ^k , whereH (z)–z=a _i ()z ⁱ . Then one can find a parameter solutionS (z) of (1) which has at each pointz ₀ belonging to the domain of definition ofS ₀, an expansion in seriesS (z)=z+b _i ()(z–z ₀) ⁱ with , for alli.This result may be applied to the bifurcation theory of vector fields of the plane. LetX be an unfolding of analytic vector fields at 0 ² such that this point is a hyperbolic saddle point for each . LetH (z) be the holonomy map ofX at the saddle point and its associated ideal of coefficients. A consequence of the above result is that one can find analytic intervals , , transversal to the separatrices of the saddle point, such that the difference between the transition mapD (z) and the identity is divisible in the ideal . Finally, suppose thatX is an unfolding of a saddle connection for a vector fieldX ₀, with a return map equal to identity. It follows from the above result that the Bautin ideal of the unfolding, defined as the ideal of coefficients of the difference between the return map and the identity at any regular pointz, can also be computed at the singular pointz=0. From this last observation it follows easily that the cyclicity of the unfoldingX , is finite and can be computed explicity in terms of the Bautin ideal.Dedicated to the memory of R. Mañé     

Sensitivity analysis of the greatest eigenvalue of a symmetric matrix via the ɛ-subdifferential of the associated convex quadratic form

LetA(·) be ann × n symmetric affine matrix-valued function of a parameteruR ^m , and let (u) be the greatest eigenvalue ofA(u). Recently, there has been interest in calculating (u), the subdifferential of atu, which is useful for both the construction of efficient algorithms for the minimization of (u) and the sensitivity analysis of (u), namely, the perturbation theory of (u). In this paper, more generally, we investigate the Legendre-Fenchel conjugate function of (·) and the -subdifferential (u) of atu. Then, we discuss relations between the set (u) and some perturbation bounds for (u).The author is deeply indebted to Professor J. B. Hiriart-Urruty who suggested this study and provided helpful advice and constant encouragement. The author also thanks the referees and the editors for their substantial help in the improvement of this paper.     

Upper bound for the size of quadratic Siegel disks

If is an irrational number, we let {p_n/q_n}_n0, be the approximants given by its continued fraction expansion. The Bruno series B() is defined as

Large triangle-free subgraphs in graphs withoutK 4

It is shown that for arbitrary positive there exists a graph withoutK ₄ and so that all its subgraphs containing more than 1/2 + portion of its edges contain a triangle (Theorem 2). This solves a problem of Erdös and Neetil. On the other hand it is proved that such graphs have necessarily low edge density (Theorem 4).Theorem 3 which is needed for the proof of Theorem 2 is an analog of Goodman's theorem [8], it shows that random graphs behave in some respect as sparse complete graphs.Theorem 5 shows the existence of a graph on less than 10¹² vertices, withoutK ₄ and which is edge-Ramsey for triangles.     

Leaves in Representation Diagrams of Bipartite Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Let ₀ > ₁ ··· > _D denote the eigenvalues of and let q ^h _ij (0 h, i, j D) denote the Krein parameters of . Pick an integer h (1 h D – 1). The representation diagram = _h is an undirected graph with vertices 0,1,...,D. For 0 i, j D, vertices i, j are adjacent in whenever i j and q ^h _ij 0. It turns out that in , the vertex 0 is adjacent to h and no other vertices. Similarly, the vertex D is adjacent to D – h and no other vertices. We call 0, D the trivial vertices of . Let l denote a vertex of . It turns out that l is adjacent to at least one vertex of . We say l is a leaf whenever l is adjacent to exactly one vertex of . We show has a nontrivial leaf if and only if is the disjoint union of two paths.     

Quasianapole Interaction of Charged Fermions

We obtain the analytic expression for the total cross section of the reaction e ^– e ⁺l ^– l ⁺ (l=,) taking possible quasianapole interaction effects into account. We find numerical restrictions on the interaction parameter value from data for the reaction e ^– e ^+–+ in the energy domain below the Z ⁰ peak.     

The Busy Period of the M/GI/∞ Queue

An equation for the distribution Z() of the duration T of the busy period in a stationary M/GI/ service system is constructed from first principles. Two scenarios are examined, being distinguished by the half-plane Re()>₀ for some ₀0 in which the generic service time random variable S, always assumed to have a finite mean E(S), has an analytic Laplace–Stieltjes transform E(e^–S ). If ₀<0 then E(e^–T ) is analytic in a half-plane (₁,), where ₀₁<0 and ₁ is determined by the distribution of S; then for any 0<s<|₁|.When ₀=0, E(e^–T ) is analytic in (0,), and now more is known about T. Inequalities on the tail () are used to show that for any 1, E(T ) is finite if and only if E(S ) is finite. It follows that the point process consisting of the starting epochs of busy periods is long range dependent if and only if E(S ²)=, in which case it has Hurst index equal to [frac12](3–), where is the moment index of S.If also the tail (x)=Pr{Sx} of the service time distribution satisfies the subexponential density condition ₀ ^x (x–u) (u)du/ (x)2E(S) as x, then (x)/ (x)e^E(S), where is the arrival rate.     

On an isomorphism problem on the closed-set lattice of a graph

Let (G) and V(G) be, respectively, the closed-set lattice and the vertex set of a graph G. Any lattice isomorphism : V(G)(G) induces a bijection : V(G)V(G) such that for each x in V(G), (x)=x' in V(G') iff ({x})={x'}. A graph G is strongly sensitive if for any graph G' and any lattice isomorphism : (G)(G), the bijection induced by is a graph isomorphism of G onto G'. In this paper we present some sufficient conditions for graphs to be strongly sensitive and prove in particular that all C ₄-free graphs and all covering graphs of finite lattices are strongly sensitive.     

A priori estimates of the solution of the dirichlet problem for the Monge-ampére equation in weight spaces

One proves that a priori boundedness of the norm of the solution of the problem det(U_xx)=f(x,u,u_x)>>0,u¦=0. The magnitudes of the exponents,() depends on whether the arguments u p occur or not in f (x,u,p).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 125, pp. 74–90, 1983.     

Wave operators in a multistratified strip

One investigates the scattering theory for the positive self-adjoint operatorH=–· acting in with = × and a bounded open set in ^n–1,n2. The real-valued function belongs toL (), is bounded from below byc>0 and there exist real-valued functions ₁ and ₂ inL () such that – _j ,j=1,2 is a short range perturbation of _j when (–1) ^j x _n +. One assumes _j = ^(j) 1_R,j=1,2, with ^(j) L bounded from below byc>0. One proves the existence and completeness of the generalized wave operators _j ^± =s – _j e ^–itHj ,j=1,2, withH _j =–· _j and _j : equal to 1 if (–1) ^j x _n >0 and to 0 if (–1) ^j x _n <0. The ranges ofW _j ^± :=( _j ^± )^* are characterized so that W ₁ ^± =Ran and . The scattering operator can then be defined.     

The random-cluster model on the complete graph

Summary The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, and Potts models of statistical physics. When the underlying graph is the complete graph onn vertices, then the associated processes are called mean-field. In this study of the mean-field random-cluster model with parametersp=/n andq, we show that its properties for any value ofq(0, ) may be derived from those of an Erds-Rényi random graph. In this way we calculate the critical point _c (q) of the model, and show that the associated phase transition is continuous if and only ifq2. Exact formulae are given for _C (q), the density of the largest component, the density of edges of the model, and the free energy. This work generalizes earlier results valid for the Potts model, whereq is an integer satisfyingq2. Equivalent results are obtained for a fixed edge-number random-cluster model. As a consequence of the results of this paper, one obtains large-deviation theorems for the number of components in the classical random-graph models (whereq=1).     

Randomly Weighted Sums of Subexponential Random Variables with Application to Ruin Theory

Let {X _k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X _k , 1 k n} and satisfying a _k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max_{1 m n k=1} ^m _k X _k > x) P (sum _k=1 ⁿ _k X _k > x) sum _k=1 ⁿ P ( _k X _k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { _k , 1 k n}. An application to ruin theory is proposed.     

Das Zeitverhalten von einfachen offenen exponentiellen Warteschlangensystemen mit unendlich vielen Warteplätzen

Zusammenfassung Die zeitabhängige (instationäre) Lösung für die Zustandswahrscheinlichkeiten und für einige Kenngrößen von Warteschlangensystemen mit einer Bedienungsstation, unendlich vielen Warteplätzen, exponentiellem Zu- und Abgang und beliebigem Anfangszustand wird bestimmt. Die ZustandswahrscheinlichkeitenP _v (), d. h. die Wahrscheinlichkeiten für Einheiten im System zur Zeit, ergeben sich als Integrale, in denen modifizierteSessel-Funktionen 1. Art auftreten. Der ErwartungswertL () und die VarianzV() der Zahl von Einheiten im System lassen sich als Integrale darstellen, in denen nur die ZustandswahrscheinlichkeitP ₀() auftritt.Für<1 und erreichen die Systeme einen stationären Zustand (für den die Lösung bekannt ist); für1 und giltP _v ()0 für alle, L(),V().Ist>1, dann wachsenL() undV() für große linear mit; ihre Asymptoten werden berechnet. Ist=1, dann wachsenL() und die Standardabweichung() für große mit ; einfache Näherungsformeln werden gefunden.

---

Summary The time dependent solution is determined for the state probabilities and for some characteristic values of queuing systems with a single server, an infinite number of waiting places, exponentially distributed inter-arrival and service times, and any initial state. The state probabilitiesP _v (), i.e. the probabilities for units in the system at time, are given in the form of integrals in which modifiedBessel functions of the first kind occur. Integrating the state probalityP ₀() over leads to the meanL() and the varianceV() of the number of units in the system.For<1 and the systems tend to a steady state (for which the solution is known); for1 and we haveP _v ()0 for all, L(),V().If>1 asymptotic expansions for large are found givingL() andV() proportional to. If=1 simple approximate formulas for large are obtained givingL() and the standard deviation() proportional to .

---

---

Vorgel. v.:J. Nitsche.     

On graphs that can be oriented as diagrams of ordered sets

We study some equivalent and necessary conditions for a finite graph to be the covering graph of a (partially) ordered set. For each 1, M. Aigner and G. Prins have introduced a notion of a vertex colouring, here called -good colouring, such that a 1-good colouring is the usual concept and graphs that have a 2-good colouring are precisely covering graphs. We present some inequalities for the corresponding chromatic numbers , especially for x ₂. There exist graphs that satisfy these inequalities for =2 but are not covering graphs. We show also that x ₂ cannot be bounded by a function of x=x ₁. A construction of Neetil and Rödl is used to show that x ₂ is not bounded by a function of the girth.     

Embeddings of Banach Spaces Into Banach Lattices and the Gordon–Lewis Property

In this paper we first show that if X is a Banach space and is a left invariant crossnorm on lX, then there is a Banach lattice L and an isometric embedding J of X into L, so that I J becomes an isometry of lX onto l_m J(X). Here I denotes the identity operator on l and l_m J(X) the canonical lattice tensor product. This result is originally due to G. Pisier (unpublished), but our proof is different. We then use this to prove the main results which characterize the Gordon–Lewis property GL and related structures in terms of embeddings into Banach lattices.     

The Number of Isomorphism Classes of Finite Groups with Given Element Orders

Let G be a finite group and _e(G) the set of element orders of G. Denote by h( _e(G)) the number of isomorphism classes of finite groups H satisfying _e(H) = _e(G). We prove that if G has at least three prime graph components, then h( _e (G)){1, }.     

On a new class of contact metric 3-manifolds

We study 3---manifolds having Q parallel to characteristic field and the scalar curvature constant along the geodesic foliation generated by e or e. We find out a new class of contact metric 3-manifolds and we give non-flat examples of this class.     

Lévy homeomorphic parametrization and exponential families

Summary Let P={P : } be an exponential family of probability distributions with the canonical parameter and consider the one to one mapping : P . It is shown that, under mild regularity assumptions, and ^–1 are continuous with respect to the Lévy metric in P and Euclidean metric in .     

k-regular factors and semi-k-regular factors in bipartite graphs

LetG be a graph, andk1 an integer. LetU be a subset ofV(G), and letF be a spanning subgraph ofG such that deg _F (x)=k for allx V(G)–U. If deg _F (x)k for allxU, thenF is called an upper semi-k-regular factor with defect setU, and if deg _F (x)k for allxU, thenF is called a lower semi-k-regular factor with defect setU. Now letG=(X, Y;E(G)) be a bipartite graph with bipartition (X,Y) such that X=Yk+2. We prove the following two results.(1) Suppose that for each subsetU ₁X such that U ₁=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.(2) Suppose that for each subsetU ₁X such that U ₁=X–1/k+1,G has a lower semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=X–1/k+1,G has a lower semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.     

The Milnor–Totaro Theorem for Space Polygons

If denotes the curvature and the torsion of a closed, generic, and oriented polygonal space curve X in , then we show that _X (² + ²) ds = _X ds + _X | | ds > 4 if is positive. We also show that _X (² + ²) ds 2n if no four consecutive vertices lie in a plane and X has linking number n with a straight line. These extend theorems of Milnor and Totaro.