On a theorem of lovász on covers inr-partite hypergraphs

A theorem of Lovász asserts that (H)/*(H)r/2 for everyr-partite hypergraphH (where and * denote the covering number and fractional covering number respectively). Here it is shown that the same upper bound is valid for a more general class of hypergraphs: those which admit a partition (V ₁, ...,V _k ) of the vertex set and a partitionp ₁+...+p _k ofr such that |eV _i |p _i r/2 for every edgee and every 1ik. Moreover, strict inequality holds whenr>2, and in this form the bound is tight. The investigation of the ratio /* is extended to some other classes of hypergraphs, defined by conditions of similar flavour. Upper bounds on this ratio are obtained fork-colourable, stronglyk-colourable and (what we call)k-partitionable hypergraphs.Supported by grant HL28438 at MIPG, University of Pennsylvania, and by the fund for the promotion of research at the Technion.This author's research was supported by the fund for the promotion of research at the Technion.     

Phragmén-Lindelöf theorems for second-order quasilinear elliptic equations

Analogues are formulated of the well-known, in the theory of analytic functions, Phragmen-Lindelöf theorem for the gradients of solutions of a broad class of quasilinear equations of elliptic type. Examples are given illustrating the accuracy of the results obtained for the gradients of solutions of the equations of the form div(|U|^–2u)=f(x, u, u), where f(x, u, u) is a function locally bounded in ²ⁿ⁺¹. f(x, 0, u)=0, uf(x, u, u) c¦u¦1+q(1+ ¦u|), > 1, c > 0, q > 0, is an arbitrary real number, and n >- 2. The basic role in the technique employed in the paper is played by the apparatus of capacitary characteristics.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 10, pp. 1376–1381, October, 1992.The author sincerely appreciates E. M. Landis's permanent attention and numerous useful discussions.     

Transversally bounded lattices

A problem stemming from a boundedness question for torsion modules and its translation into ideal lattices is explored in the setting of abstract lattices. Call a complete lattice L transversally bounded (resp., uniformly transversally bounded) if for all families (X _i)_iIof nonempty subsets of L with the property that {x _iiI}<1 for all choices of x _iX _i, almost all of the sets X _ihave join smaller than 1 (resp., _jJ X _jhas join smaller than 1 for some cofinite subset J of I). It is shown that the lattices which are transversally bounded, but not uniformly so, correspond to certain ultrafilters with peculiar boundedness properties similar to those studied by Ramsey. The prototypical candidates of the two types of lattices which one is led to construct from ultrafilters (in particular the lattices arising from what will be called Ramsey systems) appear to be of interest beyond the questions at stake.     

The Parameters of Bipartite Q-polynomial Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Suppose ₀, ₁, ..., _D is a Q-polynomial ordering of the eigenvalues of . This sequence is known to satisfy the recurrence _{i – 1} – _i + _{i + 1} = 0 (0 > i > D), for some real scalar . Let q denote a complex scalar such that q + q ^–1 = . Bannai and Ito have conjectured that q is real if the diameter D is sufficiently large.We settle this conjecture in the bipartite case by showing that q is real if the diameter D 4. Moreover, if D = 3, then q is not real if and only if ₁ is the second largest eigenvalue and the pair (, k) is one of the following: (1, 3), (1, 4), (1, 5), (1, 6), (2, 4), or (2, 5). We observe that each of these pairs has a unique realization by a known bipartite distance-regular graph of diameter 3.     

The Lie algebra of polynomial vector fields and the Jacobian conjecture

The Jacobian conjecture for polynomial maps :K ⁿ K ⁿ is shown to be equivalent to a certain Lie algebra theoretic property of the Lie algebra of formal vector fields inn variables. To be precise, let be the unique subalgebra of codimensionn (consisting of the singular vector fields),H a Cartan subalgebra of ,H the root spaces corresponding to linear forms onH and . Then every polynomial map :K ⁿ K ⁿ with invertible Jacobian matrix is an automorphism if and only if every automorphism of with (A) satisfies (A)=A.     

Convexity of Nonlinear Image of a Small Ball with Applications to Optimization

Let f: XY be a nonlinear differentiable map, X,Y are Hilbert spaces, B(a,r) is a ball in X with a center a and radius r. Suppose f (x) is Lipschitz in B(a,r) with Lipschitz constant L and f (a) is a surjection: f (a)X=Y; this implies the existence of >0 such that f (a)^* yy, yY. Then, if r,/(2L), the image F=f(B(a,)) of the ball B(a,) is convex. This result has numerous applications in optimization and control. First, duality theory holds for nonconvex mathematical programming problems with extra constraint x–a. Special effective algorithms for such optimization problems can be constructed as well. Second, the reachability set for small power control is convex. This leads to various results in optimal control.     

Coupling for τ-Dependent Sequences and Applications

Let X be a real-valued random variable and a -algebra. We show that the minimum -distance between X and a random variable distributed as X and independant of can be viewed as a dependence coefficient ( ,X) whose definition is comparable (but different) to that of the usual -mixing coefficient between and (X). We compare this new coefficient to other well known measures of dependence, and we show that it can be easily computed in various situations, such as causal Bernoulli shifts or stable Markov chains defined via iterative random maps. Next, we use coupling techniques to obtain Bennett and Rosenthal-type inequalities for partial sums of -dependent sequences. The former is used to prove a strong invariance principle for partial sums.     

The tree number of a graph with a given girth

A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.     

Weak solutions of the Stokes problem in weighted Sobolev spaces

For n2 we consider the Stokes problem in ⁿ, -u + p=f, -divu=g, in weighted Soboiev spaces H ₆ ^m,r , where the weights are proportional to (1+|x|). We prove the existence of weak solutions for any K, whereK is a discrete set of critical values. Furthermore, we characterize the solutions of the homogeneous problem.This research was supported by the DFG research group Equations of Hydrodynamics, Universities of Bayreuth and Paderborn.     

On convergence and summability of Fourier series

. , , –1<<0. .

---

---

The present work was written on the basis of two earlier works received byAnalysis Mathematica on January 16, 1979, and July 20, 1979.     

Extensions and selections in subspaces ofC(K)

LetK be a compact Hausdorff space and letFK be a peak interpolation set for a function algebraAC(K). Let be a map fromK to the family of all convex subsets of such that the set {(z, x)zK, x(z)} is open inK×C and such thatg(z)(z) (zK) for somegA. We prove that everyfC(F) satisfyingf(s)(s) (sF) (f(s)closure (s) (sF)) admits an extensionfAA} satisfyingf(z)(z) (zK) (f(z))}closure (z) (zK), respectively). We prove a more general theorem of this kind and present various applications which generalize known dominated interpolation theorems for subspaces ofC(K).     

On improved regularity of weak solutions of some degenerate,Anisotropic elliptic systems

Summary We consider a (possibly) vector-valued function u: R^N, Rⁿ, minimizing the integral , 2-2/(n*1)<p<2, whereD _i u=u/x _i or some more general functional retaining the same behaviour, we prove higher integrability for Du: D₁ u,..., D_n–1 u L^p/(p-1) and D_nu L²; this result allows us to get existence of second weak derivatives: D(D₁ u),...,D(D_n–1u)L² and D(D_n u) L _p.This work has been supported by MURST and GNAFA-CNR.     

Distribution of the number of nonappearing lengths of cycles in a random mapping

One-to-one random mappings of the set 1, 2,..., n onto itself are considered. Limit theorems are proved for the quantities _i, 0in, max _i, min _i, where _i is the number of 0in components of the vector ( ₁, ₂,..., _n) which are equal to i, 0< i< n, and ar is the number of components of dimension r of the random mapping.Translated from Matematicheskle Zametki, Vol. 23, No. 6, pp. 895–898, June, 1978.The author is grateful to V. P. Chistyakov and V. E. Stepanov for many useful remarks.     

Independence in hypergraphs

Suppose an integral function (|A|)q₁ defined on the subsets of edges of a hypergraph (X,u,) satisfies the following two conditions: 1) any set W u such that |A|(|A|) for any AW is matroidally independent; 2) if W is an independent set, then there exists a unique partitionW=T₁+ T₂+...+T_v such that |T ⁱ |=(|T ⁱ |),i1:v, and for any AW, |A|(|A|) there exists a T_i such that AT_i. The form of such a function is found, in terms of parameters of generalized connected components, hypercycles, and hypertrees.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 114, pp. 196–204, 1982.     

A bound for the error in the numerical integration of a first order quasilinear equation

We obtain a bound for the error in the numerical integration of the quasilinear equation u_t+((u))_x=0 by a finite difference method in the case when (u)0.Translated from Matematicheskie Zametki, Vol. 12, No. 2, pp. 207–215, February, 1973.     

Nonnegative Hall Polynomials

The number of subgroups of type and cotype in a finite abelian p-group of type is a polynomialg with integral coefficients. We prove g has nonnegative coefficients for all partitions and if and only if no two parts of differ by more than one. Necessity follows from a few simple facts about Hall-Littlewood symmetric functions; sufficiency relies on properties of certain order-preserving surjections that associate to each subgroup a vector dominated componentwise by . The nonzero components of (H) are the parts of , the type of H; if no two parts of differ by more than one, the nonzero components of – (H) are the parts of , the cotype of H. In fact, we provide an order-theoretic characterization of those isomorphism types of finite abelian p-groups all of whose Hall polynomials have nonnegative coefficients.     

On the uniform (C, 1)-summability of Fourier series and integrability of series with respect to multiplicative orthonormal systems

H (G), f(g)H (G) , (, 1)- OHMC G. , OHMC, A. H. . , . , OHMC, lim supp _n=, , ,n .. . , 117 234 . . -      

Converse theorems for multidimensional Kantorovich operators

L _p [0, l]. . . - .

---

---

Supported by National Science Foundation, Zhejiang Provincial Science Foundation of China, and Alexander von Humboldt Foundation of Germany.     

Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen

Ohne Zusammenfassung Zusatz bei der Korrektur: Ein vollständiger und korrekter Beweis für die Entscheidbarkeit der eingangs angeführten Aanderaaschen Klasse ((0, ), (, , ...)) erscheint demnächst im JSL (S.O. Aanderaa/H.R.Lewis: Prefix classes of Krom formulas). Ebendort wird auch die Reduktionstypeneigenschaft für ((0, ), (0, 0, )) und ((0, )), (0, 0, )) nachgewiesen, während ((0, ), (, )) sich als entscheidbar herausgestellt hat (s. E. Börger: Eine entscheidbare Klasse von Kromformeln. ZMLG 19 (1973), 117–120.) Der Kromsche Reduktionstyp konnte mittlerweile einerseits zu ((0, ), (0, 4)) verschärft werden (s. D. Rödding, E. Börger: The undecidability of (0, 4)-formulae with binary disjunctions, vorgetragen auf dem Logic Coll. Bristol 1973, ein abstract erscheint im JSL), andererseits kündigt H.R.Lewis die Reduktionstypeneigenschaft für ((0, ), (0, 1)) an (s. H.R.Lewis: Krom formulas with one dyadic predicate letter. Notices AMS 20, 5 (1973) A-500, abstr. no. 73T-E78.)Dieser Aufsatz geht aus der Dissertation [2] hervor, die dem Fachbereich Mathematik der Mathematisch-Naturwissenschaftlichen Fakultät der Universität Münster im Sommersemester 1971 vorgelegt worden ist. Die Ergebnisse stammen aus dem Wintersemester 1970/71. Eine Ankündigung der hauptsächlichen Resultate ist in den Notices of the American Mathematical Society 19, 2 (1972) A-333 unter der abstract no. * 72T-E24 erschienen.