Modules of vector fields,differential forms and degenerations of differential systems

We deal with (n−1)-generated modules of smooth (analytic, holomorphic) vector fieldsV=(X ₁,..., X_n−1) (codimension 1 differential systems) defined locally on ℝ ⁿ or ℂ ⁿ , and extend the standard duality(X ₁,..., X_n−1)↦(ω), ω=Ω(X₁,...,X_n−1,.,) (Ω−a volume form) betweenV′s and 1-generated modules of differential 1-forms (Pfaffian equations)—when the generatorsX _i are linearly independent—onto substantially wider classes of codimension 1 differential systems. We prove that two codimension 1 differential systemsV and are equivalent if and only if so are the corresponding Pfaffian equations (ω) and provided that ω has1-division property: ωΛμ=0, μ—any 1-form ⇒ μ=fω for certain function germf. The 1-division property of ω turns out to be equivalent to the following properties ofV: (a)fX∈V, f—not a 0-divisor function germ ⇒X∈V (thedivision property); (b) (V ^⊥)^⊥=V; (c)V ^⊥=(ω); (d) (ω)^⊥=V, where ⊥ denotes the passing from a module (of vector fields or differential 1-forms) to its annihilator. Supported by Polish KBN grant N^o 2 1090 91 01. Partially supported by the fund for the promotion of research at the Technion, 100–942.     

A property of (v,k, λ)-designs

It is shown that if the subsetsX ₁,...,X _v of a setX form a (v, k, λ)-design, then there does not exist another subsetX _v+1 ofX havingany cardinalityk ₁ and intersecting each of theX _j, 1≦j≦v, inany number λ₁ of elements, where 0<k ₁<v and 0<λ₁<k (in order to avoid uninteresting cases).     

A 2-factor with Short Cycles Passing Through Specified Independent Vertices in Graph

For a graph G, we define σ₂(G) := min{d(u) + d(v)|u, v ≠ ∈ E(G), u ≠ v}. Let k ≥ 1 be an integer and G be a graph of order n ≥ 3k. We prove if σ₂(G) ≥ n + k − 1, then for any set of k independent vertices v ₁,...,v _k , G has k vertex-disjoint cycles C ₁,..., C _k of length at most four such that v _i ∈ V(C _i ) for all 1 ≤ i ≤ k. And show if σ₂(G) ≥ n + k − 1, then for any set of k independent vertices v ₁,...,v _k , G has k vertex-disjoint cycles C ₁,..., C _k such that v _i ∈ V(C _i ) for all 1 ≤ i ≤ k, V(C ₁) ∪...∪ V(C _k ) = V(G), and |C _i | ≤ 4 for all 1 ≤ i ≤ k − 1. The condition of degree sum σ₂(G) ≥ n + k − 1 is sharp. Received: December 20, 2006. Final version received: December 12, 2007.     

The Banach-Mazur distance to the cube and the Dvoretzky-Rogers factorization

We show the existence of a sequence (λ _n ) of scalars withλ _n =o(n) such that, for any symmetric compact convex bodyB ⊂R ⁿ , there is an affine transformationT satisfyingQ ⊂T(B) ⊂λ _n Q, whereQ is then-dimensional cube. This complements results of the second-named author regarding the lower bound on suchλ _n . We also show that ifX is ann-dimensional Banach space andm=[n/2], then there are operatorsα:l ₂ ^m →X andβ:X→l _∞ ^m with ‖α‖·‖β‖≦C, whereC is a universal constant; this may be called “the proportional Dvoretzky-Rogers factorization”. These facts and their corollaries reveal new features of the structure of the Banach-Mazur compactum. Research performed while this author was visiting IHES. Supported in part by the NSF Grant DMS-8702058 and the Sloan Research Fellowship.     

Asymptotics of multinomial sums and identities between multi-integrals

We calculate the asymptotics of combinatorial sums ∑ _α f(α)( _α ⁿ ) ^β , whereα = (α ₁, …,α _h ) withα _i =α _j for certaini, j. Hereh is fixed and theα _i ’s are natural numbers. This implies the asymptotics of the correspondingS _n -character degrees ∑_λ f(λ)d _λ ^β . For certain sequences ofS _n characters which involve Young’s rule, the latter asymptotics were obtained earlier [1] by a different method. Equating the two asymptotics, we obtain equations between multi-integrals which involve Gaussian measures. Special cases here give certain extensions of the Mehta integral [5], [6]. Supported by the Weizmann Institute of Science, Rehovot, Israel; by the Institute for Advanced Study, Princeton, New Jersey, USA; NSF grant number DMS 9304580; and by the Centre National de Recherche Scientifique, Lille, France. This work was partially supported by an NSF grant number DMS 94-01197.     

Martingales with given maxima and terminal distributions

Let μ be any probability measure onR with λ |x|dμ(x)<∞, and let μ^* denote its associated Hardy and Littlewood maximal p.m. It is shown that for any p.m.v for which μ<ν<μ^* in the usual stochastic order, there is a martingale (X _t)_0≦t≦1 for which sup_0≦t≦1 X _t andX ₁ have respective p.m. 'sv and μ. The proof uses induction and weak convergence arguments; in special cases, explicit martingale constructions are given. These results provide a converse to results of Dubins and Gilat [6]; applications are made to give sharp martingale and ‘prophet’ inequalities. Supported in part by NSF grants DMS-86-01153 and DMS-88-01818.     

BMO-scale of distribution on ℝ n

Let S′ be the class of tempered distributions. For ƒ ∈ S′ we denote by J ^−α ƒ the Bessel potential of ƒ of order α. We prove that if J ^−α ƒ ∈ BMO, then for any λ ∈ (0, 1), J ^−α (f)_λ ∈ BMO, where (f)_λ = λ⁻ⁿ f(φ(λ⁻¹)), φ ∈ S. Also, we give necessary and sufficient conditions in order that the Bessel potential of a tempered distribution of order α > 0 belongs to the VMO space.     

Commutators in model spaces

Let θ be an inner function, let K _θ = H ² ⊖ θH ², and let S_θ : K_θ → S_θ be defined by the formula S_θf = P_θzf, where f ∈ K_θ is the orthogonal projection of H² onto K_θ. Consider the set A of all trace class operators L : K_θ → K_θ, L = ∑(·,u_n)v_n, ∑∥u_n∥∥v_n∥ < ∞ (u_n, v_n ∈ K_θ), such that ∑ū_n v_n ∈ H ₀ ¹ . It is shown that trace class commutators of the form XS_θ − S_θX (where X is a bounded linear operator on K_θ) are dense in A in the trace class norm. Bibliography: 2 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 333, 2006, pp. 54–61.     

Friabilité des valeurs d’un polynôme

Let F(X) be an absolutely irreducible polynomial in \mathbbZ [X₁,..., X_n]{\mathbb{Z} [X_{1},\dots, X_{n}]}, with degree d. We prove that, for any δ < 4/3, for any sufficiently large x, there exists a positive density of integral n-tuples m = (m ₁, . . . , m _n ) in the hypercube max |m _i | ≤ x such that every prime divisor of F(m) is smaller than x ^d–δ . This result is improved when F satisfies some geometrical hypotheses.     

Joint Distributions of Numbers of Runs of Specified Lengths in a Sequence of Markov Dependent Multistate Trials

Let Z ₀, Z ₁,...,Z _n be a sequence of Markov dependent trials with state space Ω = {F ₁,...,F _λ, S ₁,...,S _ν}, where we regard F ₁,...,F _λ as failures and S ₁,...,S _ν as successes. In this paper, we study the joint distribution of the numbers of S _i -runs of lengths k _ij (i = 1,2,...,ν, j = 1,2,...,r _i ) based on four different enumeration schemes. We present formulae for the evaluation of the probability generating functions and the higher order moments of this distribution. In addition, when the underlying sequence is i.i.d. trials, the conditional distribution of the same run statistics, given the numbers of success and failure is investigated. We give further insights into the multivariate run-related problems arising from a sequence of the multistate trials. Besides, our results have potential applications to problems of various research areas and will come to prominence in the future. This research was partially supported by the ISM Cooperative Research Program (2004-ISM·CRP-2007).     

Stable properties of plethysm : on two conjectures of Foulkes

Two conjectures made by II.O. Foulkes in 1950 can be stated as follows.

On the weak non-defectivity of veronese embeddings of projective spaces

Fix integers n, x, k such that n≥3, k>0, x≥4, (n, x)≠(3, 4) and k(n+1)<( _n ^n+x ). Here we prove that the order x Veronese embedding ofP ⁿ is not weakly (k−1)-defective, i.e. for a general S⊃P ⁿ such that #(S) = k+1 the projective space | I _2S (x)| of all degree t hypersurfaces ofP ⁿ singular at each point of S has dimension ( _n ^/n+x )−1− k(n+1) (proved by Alexander and Hirschowitz) and a general F∈| I _2S (x)| has an ordinary double point at each P∈ S and Sing (F)=S. The author was partially supported by MIUR and GNSAGA of INdAM (Italy).     

Invariant equations defining coincident root loci

Let F(x) = xⁿ+₁ x^n-1+₂ x^n-2+ ··· +_n be a polynomial with complex coefficients, and suppose we are given a partition (₁,...,_r) of n. It is a classical problem to determine explicit algebraic conditions on the _i so that F may have roots with multiplicities ₁,...,_r. We give an invariant theoretic solution to this problem, to wit, we exhibit a set of covariants of F whose vanishing is a necessary and sufficient condition. The construction of such covariants is combinatorial, and involves associating a set of graphs on n vertices (called decisive graphs) to each .Received: 28 September 2003     

Upper bound on the characters of the symmetric groups

Let C be a conjugacy class in the symmetric group S _n , and λ be a partition of n. Let f ^λ be the degree of the irreducible representation S ^λ , χ ^λ (C)– the character of S ^λ at C, and r ^λ (C)– the normalized character χ ^λ (C) f ^λ . We prove that there exist constants b > 0 and 1 > q > 0 such that for n > 4, for every conjugacy class C in S _n and every irreducible representation S ^λ of S _n ∣r ^λ (C)∣≦ ( max {q,λ ₁ n, λ ₁ ′ n}) ^{b ⋅ supp(C)} where supp (C) is the number of non-fixed digits under the action of a permutation in C, λ ₁ is the size of the largest part in λ, and λ ₁ ′ is the number of parts in λ. The proof is obtained by enumeration of rim hook tableaux, the Hook formula and probabilistic arguments. Combinatorial, algebraic and statistical applications follow this result. In particular, we estimate the rate of mixing of random walks on the alternating groups with respect to conjugacy classes. Oblatum 14-III-1995 & 30-X-1995     

On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs

Let X =  (V, E) be a connected graph. Call X super restricted edge connected in short, sup-λ′, if F is a minimum edge set of X such that X − F is disconnected and every component of X − F has at least two vertices, then F is the set of edges adjacent to a certain edge with minimum edge degree in X. A bipartite graph is said to be half vertex transitive if its automorphism group is transitive on the sets of its bipartition. In this article, we show that every connected half vertex transitive graph X with n =  |V(X)| ≥  4 and X \ncong K_1,n-1{X \ncong K_{1,n-1}} is λ′-optimal. By studying the λ′-superatoms of X, we characterize sup-λ′ connected half vertex transitive graphs. As a corollary, sup-λ′ connected Bi-Cayley graphs are also characterized.     

Random matrix products and applications to cellular automata

Let λ be the upper Lyapunov exponent corresponding to a product of i.i.d. randomm×m matrices (X _i) _i ^0/∞ over ℂ. Assume that theX _i's are chosen from a finite set {D ₀,D ₁...,D _t-1(ℂ), withP(X _i=D_j)>0, and that the monoid generated byD ₀, D₁,…, D_q−1 contains a matrix of rank 1. We obtain an explicit formula for λ as a sum of a convergent series. We also consider the case where theX _i's are chosen according to a Markov process and thus generalize a result of Lima and Rahibe [22]. Our results on λ enable us to provide an approximation for the numberN _≠0(F(x)ⁿ,r) of nonzero coefficients inF(x) ⁿ.(modr), whereF(x) ∈ ℤ[x] andr≥2. We prove the existence of and supply a formula for a constant α (<1) such thatN _≠0(F(x)ⁿ,r) ≈n ^α for “almost” everyn. Supported in part by FWF Project P16004-N05     

An asymptotic property of gap series. II

An upper bound estimate in the law of the iterated logarithm for Σf(n _k ω) where n_k+1∫n_k≧ 1 + ck ^-α (α≧0) is investigated. In the case α<1/2, an upper bound had been given by Takahashi [15], and the sharpness of the bound was proved in our previous paper [8]. In this paper it is proved that the upper bound is still valid in case α≧1/2 if some additional condition on {n _k} is assumed. As an application, the law of the iterated logarithm is proved when {n _k} is the arrangement in increasing order of the set B(τ)={₁ ⁱ ₁...q_τ ⁱ _τ|i₁,...,i_τ∈N ₀}, where τ≧ 2, N ₀=NU{0}, and q ₁,...,q _τ are integers greater than 1 and relatively prime to each others. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Polynomial-Time Algorithm to Approximate the Mixed Volume within a Simply Exponential Factor

Let K=(K ₁,…,K _n ) be an n-tuple of convex compact subsets in the Euclidean space R ⁿ , and let V(⋅) be the Euclidean volume in R ⁿ . The Minkowski polynomial V _K is defined as V _K (λ ₁,…,λ _n )=V(λ ₁ K ₁+⋅⋅⋅+λ _n K _n ) and the mixed volume V(K ₁,…,K _n ) as

Inequalities for convex bodies and polar reciprocal lattices inR n

LetL be a lattice and letU be ano-symmetric convex body inR ⁿ . The Minkowski functional ∥ ∥ _U ofU, the polar bodyU ⁰, the dual latticeL ^*, the covering radius μ(L, U), and the successive minima λ _i (L,U)i=1,...,n, are defined in the usual way. Let ℒ _n be the family of all lattices inR ⁿ . Given a pairU,V of convex bodies, we define and kh(U, V) is defined as the smallest positive numbers for which, given arbitraryL∈ℒ _n andu∈R ⁿ /(L+U), somev∈L ^* with ∥v∥ _V ≤sd(uv, ℤ) can be found. Upper bounds for jh(U, U ⁰), j=k, l, m, belong to the so-called transference theorems in the geometry of numbers. The technique of Gaussian-like measures on lattices, developed in an earlier paper [4] for euclidean balls, is applied to obtain upper bounds for jh(U, V) in the case whenU, V aren-dimensional ellipsoids, rectangular parallelepipeds, or unit balls inl _p ⁿ , 1≤p≤∞. The gaps between the upper bounds obtained and the known lower bounds are, roughly speaking, of order at most logn asn→∞. It is also proved that ifU is symmetric through each of the coordinate hyperplanes, then jh(U, U ⁰) are less thanCn logn for some numerical constantC.     

Strong approximation ofGSBV functions by piecewise smooth functions

Let Ω be an open and bounded subset ofR ⁿ with locally Lipschitz boundary. We prove that the functionsv∈SBV(Ω,R ^m ) whose jump setS _vis essentially closed and polyhedral and which are of classW ^{k, ∞} (S _v,R ^m) for every integerk are strongly dense inGSBV ^p(Ω,R ^m ), in the sense that every functionu inGSBV ^p(Ω,R ^m ) is approximated inL ^p(Ω,R ^m ) by a sequence of functions {v _k{_j∈N with the described regularity such that the approximate gradients ∇v _jconverge inL ^p(Ω,R ^nm ) to the approximate gradient ∇u and the (n−1)-dimensional measure of the jump setsS _{v j} converges to the (n−1)-dimensional measure ofS _u. The structure ofS _v can be further improved in casep≤2.

---

Sunto Sia Ω un aperto limitato diR ⁿ con frontiera localmente Lipschitziana. In questo lavoro si dimostra che le funzioniv∈SBV(Ω,R ^m ) con insieme di saltoS _v essenzialmente chiuso e poliedrale che sono di classeW ^{k, ∞} (S _v,R ^m ) per ogni interok sono fortemente dense inGSBV ^p(Ω,R ^m ), nel senso che ogni funzioneu∈GSBV ^p(Ω,R ^m ) è approssimata inL ^p(Ω,R ^m ) da una successione di funzioni {v _j}_j∈N con la regolaritá descritta tali che i gradienti approssimati ∇v _jconvergono inL ^p(Ω,R ^nm ) al gradiente approssimato ∇u e la misura (n−1)-dimensionale degli insiemi di saltoS _{v j}converge alla misura (n−1)-dimensionale diS _u. La struttura diS _vpuó essere migliorata nel caso in cuip≤2.