Weight functions on the Kneser graph and the solution of an intersection problem of Sali

LetX, Y be finite sets and suppose thatF is a collection of pairs of sets (F, G),FX,GY satisfying |FF|s, |GG|t and |FF|+|GG|s+t+1 for all (F, G),F, GF. Extending a result of Sali, we determine the maximum ofF.     

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 quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

A functional inequality for real-analytic functions

Summary Forf ( C ⁿ() and 0 t x letJ _n (f, t, x) = (–1)ⁿ f(–x)f ⁽ⁿ⁾(t) +f(x)f ⁽ⁿ⁾ (–t). We prove that the only real-analytic functions satisfyingJ _n (f, t, x) 0 for alln = 0, 1, 2, are the exponential functionsf(x) = c e ^x,c, . Further we present a nontrivial class of real-analytic functions satisfying the inequalitiesJ ₀ (f, x, x) 0 and ₀ ^x (x – t)^{n – 1}J_n(f, t, x)dt 0 (n 1).     

Turán's extremal problem in random graphs: Forbidding odd cycles

For 0<1 and graphsG andH, we writeGH if any -proportion of the edges ofG span at least one copy ofH inG. As customary, we writeC ^k for a cycle of lengthk. We show that, for every fixed integerl1 and real >0, there exists a real constantC=C(l, ), such that almost every random graphG _{n, p} withp=p(n)Cn ^–1+1/2l satisfiesG _n,p1/2+ C ^2l+1. In particular, for any fixedl1 and >0, this result implies the existence of very sparse graphsG withG _1/2+ C ^2l+1.The first author was partially supported by NSERC. The second author was partially supported by FAPESP (Proc. 93/0603-1) and by CNP_q (Proc. 300334/93-1). The third author was partially sopported by KBN grant 2 1087 91 01.     

Some Ramsey-Turán type results for hypergraphs

To everyk-graphG let(G) be the minimal real number such that for every>0 andn>n ₀(,G) everyk-graphH withn vertices and more than (+) ( ) edges contains a copy ofG. The real number (G) is defined in the same way adding the constraint that all independent sets of vertices inH have sizeo(n). Answering a problem of Erds and Sós it is shown that there exist infinitely manyk-graphs with 0<(G)<(G) for everyk3. It is worth noting that we were unable to find a singleG with the above property.This paper was written while the authors were visiting AT&T Bell Laboratories, Murray Hill, NJ 07974.     

Large deviations for the invariant measure of a reaction-diffusion equation with non-Gaussian perturbations

Summary In this paper we establish a large deviations principle for the invariant measure of the non-Gaussian stochastic partial differential equation (SPDE) _t v =v +f(x,v )+(x,v ) . Here is a strongly-elliptic second-order operator with constant coefficients, h:=DH _xx-h, and the space variablex takes values on the unit circleS ¹. The functionsf and are of sufficient regularity to ensure existence and uniqueness of a solution of the stochastic PDE, and in particular we require that 0<mM wherem andM are some finite positive constants. The perturbationW is a Brownian sheet. It is well-known that under some simple assumptions, the solutionv ² is aC ^k (S ¹)-valued Markov process for each 0<1/2, whereC (S ¹) is the Banach space of real-valued continuous functions onS ¹ which are Hölder-continuous of exponent . We prove, under some further natural assumptions onf and which imply that the zero element ofC (S ¹) is a globally exponentially stable critical point of the unperturbed equation _t ⁰ = ⁰ +f(x,⁰), that has a unique stationary distributionv ^K, on (C (S ¹), (C ^K (S ¹))) when the perturbation parameter is small enough. Some further calculations show that as tends to zero,v ^K, tends tov ^K,0, the point mass centered on the zero element ofC (S ¹). The main goal of this paper is to show that in factv ^K, is governed by a large deviations principle (LDP). Our starting point in establishing the LDP forv ^K, is the LDP for the process , which has been shown in an earlier paper. Our methods of deriving the LDP forv ^K, based on the LDP for are slightly non-standard compared to the corresponding proofs for finite-dimensional stochastic differential equations, since the state spaceC (S ¹) is inherently infinite-dimensional.This work was performed while the author was with the Department of Mathematics, University of Maryland, College Park, MD 20742, USA     

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?

Denote by the class of all triangle-free graphs on n vertices and m edges. Our main result is the following sharp threshold, which answers the question for which densities a typical triangle-free graph is bipartite. Fix > 0 and let . If n/2 m (1 – ) t ₃, then almost all graphs in are not bipartite, whereas if m (1 + )t ₃, then almost all of them are bipartite. For m (1 + )t ₃, this allows us to determine asymptotically the number of graphs in . We also obtain corresponding results for C -free graphs, for any cycle C of fixed odd length. Forschergruppe Algorithmen, Struktur, Zufall supported by Deutsche Forschungsgemeinschaft grant FOR 413/1-1     

Nonstandard analysis of ordered sets

We introduce a nonstandard approach to the study of ordered setsX based on a classification of the elements of the ordered set *X into three types, upward, downward, and lateral, which may be thought of dynamically as arising from the possibilities of upward, downward, and lateral motion withinX. Initial applications include the characterization thatX has no infinite diverse subset iff *X has no lateral elements, a result subsequently exploited in work on the interval topology and order-compatibility, where we give a nonstandard proof of Naito's result that ifX has no infinite diverse subset, it has a unique order-compatible topology. We also describe how the completion of a nonempty linearly ordered setX may be obtained as a quotient of *X.     

A chord-stretching map of a convex loop is an isometry

Let ⁿ be n-dimensional Euclidean space, and let : [0, L] ⁿ and : [0, L] ⁿ be closed rectifiable arcs in ⁿ of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C ² curves. In this paper we prove the conjecture in general.     

On optimality of spline interpolation for recovery of differentiable functions

W _p ^r (1p<) , . - r -1. =1 r-2.     

Complementary permutations for abelian groups

Summary LetG be an additively written abelian group and leth: G G be a given function. M. Hall Jr. (1952) and L. Fuchs (1958) already answered the following question. For what functionsh: G G does the functional equation(x) + (x) = h(x) (x G) have as its solution a pair of permutations and ofG? In this paper, we give explicit constructions of such a pair, in a number of cases, in particular whenh(x) x andG is finite. We further determine the finite groupsG where the latter, can be chosen to be automorphisms.In the case whereG is an infinite topological group, we study in how far and can be chosen as Borel measurable permutations, given thath: G G itself is Borel measurable.     

Graph products and monochromatic multiplicities

Arcane two-edge-colourings of complete graphs were described in [13], in which there are significantly fewer monochromaticK _r 's than in a random colouring (so disproving a conjecture of Erds [2]). Jagger, ovíek and Thomason [7] showed that the same colourings have fewer monochromaticG's than do random colourings for any graphG containingK ₄.The purpose of this note is to point out that these colourings are not as obscure as might appear. There is in fact a large, natural and easily described class of colourings of the above kind; the specific examples used in [13] and [7] fall into this class.     

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.     

Présentations des groupes de Fischer (II)

In this paper we give Coxeter presentation (X, ) for the three Fischer groupsG=Fi₂₂, Fi₂₃, Fi₂₄; we apply methods exposed in the first part. Each of these groups is generated by a class of 3-transpositions (named here a Fischer class) in which elements ofX are chosen. A subset of is the set of all the relations (xy) ^m(x,y)=1, wherex andy are inX and wherem(x,y) means the order ofxy inG. We obtainG as a specified quotient of the Coxeter group (X, ) with the appropriate diagram .     

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.     

A-stable spline-collocation methods of multivalue type

In this paper the general classV of spline-collocation methods presented by Mülthei is investigated. The methods ofV approximate solutions of first order initial value problems. ClassV contains as subclass the methods of so-called multivalue type, and in particular contains the generalized singly-implicit methods treated by Butcher.Any multivalue type representativeU V yields a matrix valued function corresponding toU, which characterizes the region of absolute stability ofU. If a sequence (U()) of multivalue type representatives ofV tending to some singlevalue type representative V is considered, it can easily be seen by the structure of , that the sequence of the greatest eigenvalues of the (.,) tends to the stability function corresponding to . This fact allows one to construct one-parameter families of A-stable methods of multivalue type.     

Harmonic functions on nilpotent groups

For a probability measure on a locally compact groupG which is not supported on any proper closed subgroup, an elementF ofL (G) is called -harmonic if F(st)d(t)=F(s), for almost alls inG. Constant functions are -harmonic and it is known that for abelianG all -harmonic functions are constant. For other groups it is known that non constant -harmonic functions exist and the question of whether such functions exist on nilpotent groups is open, though a number of partial results are known. We show that for nilpotent groups of class 2 there are no non constant -harmonic functions. Our methods also enable us to give new proofs of results similar to the known partial results.     

Stability of unconditional convergence almost everywhere

We will investigate the properties of series of functions which are unconditionally convergent almost everywhere on [0, 1]. We will establish the following theorem: If the series _k=1 f _k(x) converges unconditionally almost everywhere, then there exists a sequence {_k} ₁ ,_k , such that if _{k k} , k=1, 2,..., the series _{k=1 k}/k(x) converges unconditionally almost every-where.Translated from Mate matte heskie Zametki, Vol. 14, No. 5, pp. 645–654, November, 1973.The author wishes to thank Professor P. L. Ul'yanov for his help.     

О метрических свойст вах особых множеств г оломорфных функций нескольких п еременных

LetG be a domain inC ⁿ ,EG, mes E=0 for (r)=r ^2n–1(r), where (r) is a nondecreasing non-negative function (r>0). Iff(z) is holomorphic inGE and (,f, GE)(), C=const, thenf(z) is holomorphic inG.The impossibility of the relaxation of the stipulations on () and(r) is also established.The statement above is a corollary to a more general result about the representation of a holomorphic function from a certain class in the form of an integral with respect to -measure, extended over the set of singular points of the function.