On depth first search strees inm-out digraphs

We consider depth first search (DFS for short) trees in a class of random digraphs: am-out model. Let _i be thei ^th vertex encountered by DFS andL(i, m, n) be the height of _i in the corresponding DFS tree. We show that ifi/n asn, then there exists a constanta(,m), to be defined later, such thatL(i, m, n)/n converges in probability toa(,m) asn. We also obtain results concerning the number of vertices and the number of leaves in a DFS tree.     

Conditions for separately subharmonic functions to be subharmonic

Letu be a function on ^m × ⁿ , wherem2 andn2, such thatu(x, .) is subharmonic on ⁿ for each fixedx in ^m andu(.,y) is subharmonic on ^m for each fixedy in ⁿ . We give a local integrability condition which ensures the subharmonicity ofu on ^m × ⁿ , and we show that this condition is close to being sharp. In particular, the local integrability of (log⁺ u ⁺) ^m+n–2+ is enough to secure the subharmonicity ofu if >0, but not if <0.     

Skew-symmetric association schemes with two classes and strongly regular graphs of type L 2n−1(4n−1)

A construction of a pair of strongly regular graphs ⁿ and ⁿ of type L _2n–1(4n–1) from a pair of skew-symmetric association schemes W, W of order 4n–1 is presented. Examples of graphs with the same parameters as ⁿ and ⁿ, i.e., of type L _2n–1(4n–1), were known only if 4n–1=p ³, where p is a prime. The first new graph appearing in the series has parameters (v, k, )=(225, 98, 45). A 4-vertex condition for relations of a skew-symmetric association scheme (very similar to one for the strongly regular graphs) is introduced and is proved to hold in any case. This has allowed us to check the 4-vertex condition for ⁿ and ⁿ, thus to prove that ⁿ and ⁿ are not rank three graphs if n>2.     

Geometric methods in the study of irregularities of distribution

Let be a signed measure on E ^d with E ^d =0 and ¦¦E^d<. DefineD _s() as sup ¦H¦ whereH is an open halfspace. Using integral and metric geometric techniques results are proved which imply theorems such as the following.Theorem A. Let be supported by a finite pointsetp _i. ThenD _s()>c _d(₁/ ₂)^1/2{ _{i(p i})²}^1/2 where ₁ is the minimum distance between two distinctp _i, and ₂ is the maximum distance. The numberc _d is an absolute dimensional constant. (The number .05 can be chosen forc ₂ in Theorem A.)Theorem B. LetD be a disk of unit area in the planeE ², andp ₁,p ₂,...,p _n be a set of points lying inD. If m if the usual area measure restricted toD, while nP _i=1/n defines an atomic measure _n, then independently of _n,nD _s(m – _n) .0335n ^1/4. Theorem B gives an improved solution to the Roth disk segment problem as described by Beck and Chen. Recent work by Beck shows thatnD _s(m – _n)cn ^1/4(logn)^–7/2.     

Differentiability properties of the minimal average action

Given aZ ⁿ⁺¹-periodic variational principle onR ⁿ⁺¹ we look for solutionsu:R ⁿ R minimizing the variational integral with respect to compactly supported variations. To every vector R ⁿ we consider a subset of solutions which have an average slope when averaging overR ⁿ. The minimal average action A() is defined by the average value of the variational integral given by a solution with average slope . Our main result is:A is differentiable at if and only if the set is totally ordered (in the natural sense). In case that is not totally ordered,A is differentiable at in some direction R ⁿ{0} if and only if is orthogonal to the subspace defined by the rational dependency of . Assuming that the i^th component of is rational with denominator sⁱ N in lowest terms, we show: The difference of right- and left-sided derivative in the i^th standard unit direction is bounded by const · .     

Mixing and some integro-functional equations

Summary It is proved that the operatorP: L ¹ (0, ) L ¹(0, ), given byPg(z) = _z/c [g(x)/cx]dx, is completely mixing, i.e.,P ⁿ g ₁ 0 forg L ¹(0, ) with g dx = 0. This implies that, forc (0, 1), each continuous and bounded solution of the equationf(x)= ₀ ^cx f(t)dt/(cx) (x (0, 1]) is constant.     

On the width of an orientation of a tree

There are 2 ^n-1 ways in which a tree on n vertices can be oriented. Each of these can be regarded as the (Hasse) diagram of a partially ordered set. The maximal and minimal widths of these posets are determined. The maximal width depends on the bipartition of the tree as a bipartite graph and it can be determined in time O(n). The minimal width is one of [/2] or [/2]+1, where is the number of leaves of the tree. An algorithm of execution time O(n + ² log ) to construct the minimal width orientation is given.This research was partially funded by the National Science and Engineering Research Council of Canada under Grant Number A4219.     

Discrepancy and approximations for bounded VC-dimension

Let (X, ) be a set system on ann-point setX. For a two-coloring onX, itsdiscrepancy is defined as the maximum number by which the occurrences of the two colors differ in any set in . We show that if for anym-point subset the number of distinct subsets induced by onY is bounded byO(m ^d) for a fixed integerd, then there is a coloring with discrepancy bounded byO(n ^1/2–1/2d(logn)^1+1/2d ). Also if any subcollection ofm sets of partitions the points into at mostO(m ^d) classes, then there is a coloring with discrepancy at mostO(n ^1/2–1/2dlogn). These bounds imply improved upper bounds on the size of -approximations for (X, ). All the bounds are tight up to polylogarithmic factors in the worst case. Our results allow to generalize several results of Beck bounding the discrepancy in certain geometric settings to the case when the discrepancy is taken relative to an arbitrary measure.Work of J.M. and E.W. was partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 3075 (project ALCOM). L.W. acknowledges support from the Deutsche Forschungsgemeinschaft under grant We 1265/1-3, Schwerpunktprogramm Datenstrukturen und effiziente Algorithmen.     

On the Sobolev distance of convex bodies

Summary LetK ^d denote the cone of all convex bodies in the Euclidean spaceK ^d . The mappingK h _K of each bodyK K ^d onto its support function induces a metric _w onK ^d by" _w (K, L)h _L –h _{K w} where _w is the Sobolev I-norm on the unit sphere . We call _w (K, L) the Sobolev distance ofK andL. The goal of our paper is to develop some fundamental properties of the Sobolev distance.     

Asymptotic limit law for the close approach of two trajectories in expanding maps of the circle

Summary Given two pointsx, yS ¹ randomly chosen independently by a mixing absolutely continuous invariant measure of a piecewise expanding and smooth mapf of the circle, we consider for each >0 the point process obtained by recording the timesn>0 such that |f ⁿ (x)–f ⁿ (y)|. With the further assumption that the density of is bounded away from zero, we show that when tends to zero the above point process scaled by –1 converges in law to a marked Poisson point process with constant parameter measure. This parameter measure is given explicity by an average on the rate of expansion off.Partially supported by FAPESP grant number 90/3918-5     

Improved lower bounds on the length of Davenport-Schinzel sequences

We derive lower bounds on the maximal length _s(n) of (n, s) Davenport Schinzel sequences. These bounds have the form _2s=1(n)=(n^s(n)), where(n) is the extremely slowly growing functional inverse of the Ackermann function. These bounds extend the nonlinear lower bound ₃ (n)=(n(n)) due to Hart and Sharir [5], and are obtained by an inductive construction based upon the construction given in [5].Work on this paper has been supported by Office of Naval Research Grant N00014-82-K-0381, National Science Foundation Grant No. NSF-DCR-83-20085, and by grants from the Digital Equipment Corporation, and the IBM Corporation.     

An Explicit Construction for a Ramsey Problem

An explicit coloring of the edges of K_n is constructed such that every copy of K₄ has at least four colors on its edges. As n , the number of colors used is n^1/2+o(1). This improves upon the previous bound of O(n^2/3) due to Erds and Gyárfás obtained by probabilistic methods. The exponent 1/2 is optimal, since it is known that at least (n^1/2) colors are required in such a coloring.The coloring is related to constructions giving lower bounds for the multicolor Ramsey number r_k(C₄). It is more complicated however, because of restrictions imposed on interactions between color classes.* Research supported in part by NSF Grant No. DMS–9970325.     

On context patterns associated with concept lattices

In this paper, we consider the following reconstruction problem: Given two ordered sets (G, ) and (M, ) representing join- and meet-irreducible elements, respectively together with three relationsJ,, onG×M modelling comparability (gm) and maximal noncomparability with respect tog (gm, butgm*) and with respect tom (gm, butgm*). We determine necessary and sufficient conditions for the existence of a finite latticeL and injections :GJ(L) and :MM(L) such that the given order relations and the abstract relations coincide with the one induced by the latticeL.     

Quelques propriétés des solutions de l'équation de Ginzburg-Landau sur un ouvert de ∝2

For a solution u of –u=u(1–|u|²) on the whole plane, |u|<1 holds everywhere unless u=eⁱ for some ; the derivatives of order k have moduli a constant M _kdepending only on k. For a solution u on an open set ², the moduli of u and its derivatives have upper bounds depending only on the distance to ²\ therefore the set of solutions on a given is compact in C() for the topology of uniform convergence on compact subsets of . For a solution u such that |u|<1, 1–|u| satisfies an estimation similar to the classical Harnack inequality for positive harmonic functions.Finally, if is bounded and |u| has a lim supm at each boundary point, the |u|m in if m1, but if m<1 then |u| admits only a majorant S _m with values in ]m, 1[ and sufficient conditions are given for lim S _m =0 or S _m =O(m) as m0.

     

Local Recognition Of Non-Incident Point-Hyperplane Graphs

Let be a projective space. By H() we denote the graph whose vertices are the non-incident point-hyperplane pairs of , two vertices (p,H) and (q,I) being adjacent if and only if p I and q H. In this paper we give a characterization of the graph H() (as well as of some related graphs) by its local structure. We apply this result by two characterizations of groups G with PSL _n ( )GPGL _n ( ), by properties of centralizers of some (generalized) reflections. Here is the (skew) field of coordinates of .     

Symmetric balanced ternary designs with ϱ1 = 1 or 2

Summary We prove the following two non-existence theorems for symmetric balanced ternary designs. If ₁ = 1 and 0 (mod 4) then eitherV = + 1 or 4₂ – + 1 is a square and (4₂ – + 1) divides ² – 1. If ₁ = 2 thenV = ((m + 1)/2) ² + 2,K = (m ² + 7)/4 and = ((m – 1)/2)² + 1 wherem 3 (mod 4). An example belonging to the latter series withV = 18 is constructed.     

On the extreme spectral properties of Toeplitz matrices generated byL 1 functions with several minima/maxima

In this paper we are concerned with the asymptotic behavior of the smallest eigenvalue ₁ ⁽ⁿ⁾ of symmetric (Hermitian)n ×n Toeplitz matricesT _n (f) generated by an integrable functionf defined in [–, ]. In [7, 8, 11] it is shown that ₁ ⁽ⁿ⁾ tends to essinff =m _f in the following way: ₁ ⁽ⁿ⁾ –m _f 1/n ^2k . These authors use three assumptions:A1)f –m _f has a zero inx =x ₀ of order 2k.A2)f is continuous and at leastC ^2k in a neighborhood ofx ₀.A3)x =x ₀ is the unique global minimum off in [–, ]. In [10] we have proved that the hypothesis of smoothnessA2 is not necessary and that the same result holds under the weaker assumption thatf L ¹[–, ]. In this paper we further extend this theory to the case of a functionf L ¹[–, ] having several global minima by suppressing the hypothesisA3 and by showing that the maximal order 2k of the zeros off –m _f is the only parameter which characterizes the rate of convergence of ₁ ⁽ⁿ⁾ tom _f .     

A class of non-Moufang Bol loops isomorphic to all their loop isotopes

For any two primes, , such that< and divides–1, it is shown that there exists a non-Moufang Bol loop of order ² which is isomorphic to each of its loop isotopes.     

On the stochastic independence properties of hard-core distributions

A probability measurep on the set of matchings in a graph (or, more generally 2-bounded hypergraph) ishard-core if for some : [0,), the probabilityp(M) ofM is proportional to . We show that such distributions enjoy substantial approximate stochastic independence properties. This is based on showing that, withM chosen according to the hard-core distributionp, MP () the matching polytope of , and >0, if the vector ofmarginals, (Pr(AM):A an edge of ), is in (1–) MP (), then the weights (A) are bounded by someA(). This eventually implies, for example, that under the same assumption, with fixed, as the distance betweenA, B tends to infinity.Thought to be of independent interest, our results have already been applied in the resolutions of several questions involving asymptotic behaviour of graphs and hypergraphs (see [14, 16], [11]–[13]).Supported in part by NSFThis work forms part of the author's doctoral dissertation [16]; see also [17]. The author gratefully acknowledges NSERC for partial support in the form of a 1967 Science and Engineering Scholarship.     

Surjectivity of quotient maps for algebraic (ℂ,+)-actions and polynomial maps with contractible fibers

In this paper we establish two results concerning algebraic (,+)-actions on ⁿ . First, let be an algebraic (,+)-action on ³. By a result of Miyanishi, its ring of invariants is isomorphic to [t ₁,t ₂]. Iff ₁,f ₂ generate this ring, the quotient map of is the mapF:³²,x(f ₁(x), f₂(x)). By using some topological arguments we prove thatF is always surjective. Secon, we are interested in dominant polynomial mapsF: ^{n n-1} whose connected components of their generic fibers are contractible. For such maps, we prove the existence of an algebraic (,+)-action on ⁿ for whichF is invariant. Moreover we give some conditions so thatF*([t ₁,...,t _n-1 ]) is the ring of invariants of .Dedicated to all my friends and my family