Tiling Transitive Tournaments and Their Blow-ups

Let TT _k denote the transitive tournament on k vertices. Let TT(h,k) denote the graph obtained from TT _k by replacing each vertex with an independent set of size h≥1. The following result is proved: Let c ₂=1/2, c ₃=5/6 and c _k =1−2^{−k−log k} for k≥4. For every ∈>0 there exists N=N(∈,h,k) such that for every undirected graph G with n>N vertices and with δ(G)≥c _k n, every orientation of G contains vertex disjoint copies of TT(h,k) that cover all but at most ∈n vertices. In the cases k=2 and k=3 the result is asymptotically tight. For k≥4, c _k cannot be improved to less than 1−2^{−0.5k(1+o(1))}. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations

An (n, d, k)-mapping f is a mapping from binary vectors of length n to permutations of length n + k such that for all x, y {0,1}ⁿ, d_H (f(x), f(y)) ≥ d_H (x, y) + d, if d_H (x, y) ≤ (n + k) − d and d_H (f(x), f(y)) = n + k, if d_H (x, y) > (n + k) − d. In this paper, we construct an (n,3,2)-mapping for any positive integer n ≥ 6. An (n, r)-permutation array is a permutation array of length n and any two permutations of which have Hamming distance at least r. Let P(n, r) denote the maximum size of an (n, r)-permutation array and A(n, r) denote the same setting for binary codes. Applying (n,3,2)-mappings to the design of permutation array, we can construct an efficient permutation array (easy to encode and decode) with better code rate than previous results [Chang (2005). IEEE Trans inf theory 51:359–365, Chang et al. (2003). IEEE Trans Inf Theory 49:1054–1059; Huang et al. (submitted)]. More precisely, we obtain that, for n ≥ 8, P(n, r) ≥ A(n − 2, r − 3) > A(n − 1,r − 2) = A(n, r − 1) when n is even and P(n, r) ≥ A(n − 2, r − 3) = A(n − 1, r − 2) > A(n, r − 1) when n is odd. This improves the best bound A(n − 1,r − 2) so far [Huang et al. (submitted)] for n ≥ 8. The work was supported in part by the National Science Council of Taiwan under contract NSC-93-2213-E-009-117     

Distribution of a certain partition function modulo powers of primes

In this paper, we study a certain partition function a(n) defined by Σ _n≥0 a(n)q ⁿ := Π _n=1(1 − q ⁿ )⁻¹(1 − q ²ⁿ )⁻¹. We prove that given a positive integer j ≥ 1 and a prime m ≥ 5, there are infinitely many congruences of the type a(An + B) ≡ 0 (mod m ^j ). This work is inspired by Ono’s ground breaking result in the study of the distribution of the partition function p(n).     

Existence principles for higher-order nonlocal boundary-value problems and their applications to singular Sturm-Liouville problems

We present existence principles for the nonlocal boundary-value problem (φ(u^(p−1)))′=g(t,u,...,u^(p−1), α_k(u)=0, 1≤k≤p−1, where p ≥ 2, π: ℝ → ℝ is an increasing and odd homeomorphism, g is a Carathéodory function that is either regular or has singularities in its space variables, and α _k: C ^p−1[0, T] → ℝ is a continuous functional. An application of the existence principles to singular Sturm-Liouville problems (−1)ⁿ(φ(u⁽²ⁿ⁻⁾))′=f(t,u,...,u⁽²ⁿ⁻¹⁾), u^(2k)(0)=0, α_ku^(2k)(T)+b_ku^(2k=1)(T)=0, 0≤k≤n−1, is given. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 2, pp. 240–259, February, 2008.     

Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs

 Assume that G is a 3-colourable connected graph with e(G) = 2v(G) −k, where k≥ 4. It has been shown that s ₃(G) ≥ 2 ^{k −3}, where s _r (G) = P(G,r)/r! for any positive integer r and P(G, λ) is the chromatic polynomial of G. In this paper, we prove that if G is 2-connected and s ₃(G) < 2 ^{k −2}, then G contains at most v(G) −k triangles; and the upper bound is attained only if G is a graph obtained by replacing each edge in the k-cycle C _k by a 2-tree. By using this result, we settle the problem of determining if W(n, s) is χ-unique, where W(n, s) is the graph obtained from the wheel W _n by deleting all but s consecutive spokes. Received: January 29, 1999 Final version received: April 8, 2000     

Hypergraphs with independent neighborhoods

For each k ≥ 2, let ρ _k ∈ (0, 1) be the largest number such that there exist k-uniform hypergraphs on n vertices with independent neighborhoods and (ρ _k + o(1))( _k ⁿ ) edges as n → ∞. We prove that ρ _k = 1 − 2logk/k + Θ(log log k/k) as k → ∞. This disproves a conjecture of Füredi and the last two authors.     

Estimates for the number of rational points on convex curves and surfaces

Let Γ ⊂ ℝ^d be a bounded strictly convex surface. We prove that the number k_n(Γ) of points of Γ that lie on the lattice satisfies the following estimates: lim inf k_n(Γ)/n^d−2 < ∞ for d ≥ 3 and lim inf k_n(Γ)/log n < ∞ for d = 2. Bibliography: 9 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 344, 2007, pp. 174–189.     

On local Torelli for a class of extremal varieties

We study the local behaviour of the period map for smooth non-degenerate extremal varieties sitting inside scrolls. We conclude with the following theorem:the period map for smooth non-degenerate extremal varieties of dimension k ≠ 2,3in n-projective space with n≥2k+4is generically locally injective for sufficiently high degree d. In particular, the following two conditions on d suffice: (1)d≥3.k.(n−k)+3; (2)d≥(n − k)²+1.     

Propertyf −1(S) =g −1(S) for entire and meromorphicP-adic functions

LetW be an algebraically closed filed of characteristic zero, letK be an algebraically closed field of characteristic zero, complete for an ultrametric absolute value, and letA(K) (resp. ℳ(K)) be the set of entire (resp. meromorphic) functions inK. For everyn≥7, we show that the setS _n(b) of zeros of the polynomialx ⁿ−b (b≠0) is such that, iff, g ∈W[x] or iff, g ∈A(K), satisfyf ⁻¹(S _n(b))=g ⁻¹(S _n(b)), thenf ⁿ=g ⁿ. For everyn≥14, we show thatS _n(b) is such that iff, g ∈W({tx}) or iff, g ∈ ℳ(K) satisfyf ⁻¹(S _n(b))=g ⁻¹(S _n(b)), then eitherf ⁿ=g ⁿ, orfg is a constant. Analogous properties are true for complex entire and meromorphic functions withn≥8 andn≥15, respectively. For everyn≥9, we show that the setY _n(c) of zeros of the polynomial , (withc≠0 and 1) is an ursim ofn points forW[x], and forA(K). For everyn≥16, we show thatY _n(c) is an ursim ofn points forW(x), and for ℳ(K). We follow a method based on thep-adic Nevanlinna Theory and use certain improvement of a lemma obtained by Frank and Reinders.     

Distributions of Points in <Emphasis Type="Italic">d</Emphasis> Dimensions and Large <Emphasis Type="Italic">k</Emphasis>-Point Simplices

We consider a variant of Heilbronn’s triangle problem by investigating for a fixed dimension d≥2 and for integers k≥2 with k≤d distributions of n points in the d-dimensional unit cube [0,1] ^d , such that the minimum volume of the simplices, which are determined by (k+1) of these n points is as large as possible. Denoting by Δ _k,d (n), the supremum of this minimum volume over all distributions of n points in [0,1] ^d , we show that c _k,d ⋅(log n)^1/(d−k+1)/n ^k/(d−k+1)≤Δ _k,d (n)≤c _k,d ′/n ^k/d for fixed 2≤k≤d, and, moreover, for odd integers k≥1, we show the upper bound Δ _k,d (n)≤c _k,d ″/n ^{k/d+(k−1)/(2d(d−1))}, where c _k,d ,c _k,d ′,c _k,d ″>0 are constants. A preliminary version of this paper appeared in COCOON ’05.     

A characteristic property of spheres

Summary We prove: Let S be a closed n-dimensional surface in an(n+1)-space of constant curvature (n ≥ 2); k₁ ≥ ... ≥ k_n denote its principle curvatures. Let φ(ξ₁, ..., ξ_n) be such that . Then if φ(k₁, ..., k_n)=const on S and S is subject to some additional general conditions (those(II ₀) or(II) n^o 1), S is a sphere. To Enrico Bompiani on his scientific Jubilee     

A sufficient degree condition for a graph to contain all trees of size <Emphasis Type="Italic">k</Emphasis>

The Erdős-Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k− 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k formulated in terms of the minimum edge degree ζ(G) of a graph G defined as ζ(G) = min{d(u) + d(v) − 2: uv ∈ E(G)}. More precisely, we show that a connected graph G with maximum degree Δ(G) ≥ k and minimum edge degree ζ(G) ≥ 2k − 4 contains every tree of k edges if d _G (x) + d _G (y) ≥ 2k − 4 for all pairs x, y of nonadjacent neighbors of a vertex u of d _G (u) ≥ k.     

On the Upper Bounds of the Numbers of Perfect Matchings in Graphs with Given Parameters

Let φ(G),κ(G),α(G),χ(G),cl(G),diam(G)denote the number of perfect matchings,connectivity,independence number,chromatic number,clique number and diameter of a graph G,respectively.In this note,by constructing some extremal graphs,the following extremal problems are solved:1.max{φ(G):|V(G)|=2n,κ(G)≤k}=k[(2n-3)!!],2.max{φ(G):|V(G)|=2n,α(G)≥k}=[multiply from i=0 to k-1(2n-k-i)[(2n-2k-1)!!],3.max{φ(G):|V(G)|=2n,χ(G)≤k}=φ(T_(k,2n))T_(k,2n)is the Turán graph,that is a complete k-partite graphon 2n vertices in which all parts are as equal in size as possible,4.max{φ(G):|V(G)|=2n,cl(G)=2}=n1,5.max{φ(G):|V(G)|=2n,diam(G)≥2}=(2n-2)(2n-3)[(2n-5)!!],max{φ(G):|V(G)|=2n,diam(G)≥3}=(n-1)~2[(2n-5)!!].     

On the distribution of reducible polynomials

Let ℛ _n (t) denote the set of all reducible polynomials p(X) over ℤ with degree n ≥ 2 and height ≤ t. We determine the true order of magnitude of the cardinality |ℛ _n (t)| of the set ℛ _n (t) by showing that, as t → ∞, t ² log t ≪ |ℛ₂(t)| ≪ t ² log t and t ⁿ ≪ |ℛ _n (t)| ≪ t _n for every fixed n ≥ 3. Further, for 1 < n/2 < k < n fixed let ℛ _k,n (t) ⊂ ℛ _n (t) such that p(X) ∈ ℛ _k,n (t) if and only if p(X) has an irreducible factor in ℤ[X] of degree k. Then, as t → ∞, we always have t ^k+1 ≪ |ℛ _k,n (t)| ≪ t ^k+1 and hence |ℛ _n−1,n (t)| ≫ |ℛ _n (t)| so that ℛ _n−1,n (t) is the dominating subclass of ℛ _n (t) since we can show that |ℛ _n (t)∖ℛ _n−1,n (t)| ≪ t ⁿ⁻¹(log t)².On the contrary, if R _n ^s (t) is the total number of all polynomials in ℛ _n (t) which split completely into linear factors over ℤ, then t ²(log t) ⁿ⁻¹ ≪ R _n ^s (t) ≪ t ² (log t) ⁿ⁻¹ (t → ∞) for every fixed n ≥ 2.      

On free semilattice-ordered semigroups satisfying x n =x

Let B(k,0,n) denote the group with k generators which is free in the group variety defined by the identity x ⁿ =1. Let B _slo (k,1,n) denote the semilattice-ordered semigroup with k generators which is free in the semilattice-ordered semigroup variety defined by the identity x ⁿ =x. We prove a generalization of the Green-Rees theorem: B _slo (k,1,n) is finite for all k≥1 if and only if B(k,0,n−1) is finite for all k≥1. We find a formula for card(B _slo (1,1,n)). We construct B _slo (k,1,n) for some concrete values of k and n.     

Equipartition of mass distributions by hyperplanes

We consider the problem of determining the smallest dimensiond=Δ(j, k) such that, for anyj mass distributions inR ^d , there arek hyperplanes so that each orthant contains a fraction 1/2 ^k of each of the masses. The case Δ(1,2)=2 is very well known. The casek=1 is answered by the ham-sandwich theorem with Δ(j, 1)=j. By using mass distributions on the moment curve the lower bound Δ(j, k)≥j(2 ^k −1)/k is obtained. We believe this is a tight bound. However, the only general upper bound that we know is Δ(j, k)≤j2 ^k−1. We are able to prove that Δ(j, k)=⌈j(^2k−1/k⌉ for a few pairs (j, k) ((j, 2) forj=3 andj=2 ⁿ withn≥0, and (2, 3)), and obtain some nontrivial bounds in other cases. As an intermediate result of independent interest we prove a Borsuk-Ulam-type theorem on a product of balls. The motivation for this work was to determine Δ(1, 4) (the only case forj=1 in which it is not known whether Δ(1,k)=k); unfortunately the approach fails to give an answer in this case (but we can show Δ(1, 4)≤5). This research was supported by the National Science Foundation under Grant CCR-9118874.     

Bounding the number of connected components of a real algebraic set

For every polynomial mapf=(f ₁,…,f _k): ℝ ⁿ →ℝ ^k , we consider the number of connected components of its zero set,B(Z _f) and two natural “measures of the complexity off,” that is the triple(n, k, d), d being equal to max(degree off _i), and thek-tuple (Δ₁,...,Δ₄), Δ _k being the Newton polyhedron off _i respectively. Our aim is to boundB(Z _f) by recursive functions of these measures of complexity. In particular, with respect to (n, k, d) we shall improve the well-known Milnor-Thom’s bound μ _d (n)=d(2d−1) ⁿ⁻¹. Considered as a polynomial ind, μ _d (n) has leading coefficient equal to 2 ⁿ⁻¹. We obtain a bound depending onn, d, andk such that ifn is sufficiently larger thank, then it improves μ _d (n) for everyd. In particular, it is asymptotically equal to 1/2(k+1)n ^k−1 dⁿ, ifk is fixed andn tends to infinity. The two bounds are obtained by a similar technique involving a slight modification of Milnor-Thom's argument, Smith's theory, and information about the sum of Betti numbers of complex complete intersections.     

Estimates on binomial sums of partition functions

Let p(n) denote the partition function and define where p(0)= 1. We prove that p(n,k) is unimodal and satisfies for fixed n≥ 1 and all 1≤k≤n. This result has an interesting application: the minimal dimension of a faithful module for a k-step nilpotent Lie algebra of dimension n is bounded by p(n,k) and hence by , independently of k. So far only the bound n ^{n −1} was known. We will also prove that for n≥ 1 and . Received: 17 December 1999     

Trisecant lemma for nonequidimensional varieties

Let X be an irreducible projective variety over an algebraically closed field of characteristic zero. For ≥ 3, if every (r−2)-plane , where the x _i are generic points, also meets X in a point x _r different from x ₁,..., x _r−1, then X is contained in a linear subspace L such that codim _L X ≥ r − 2. In this paper, our purpose is to present another derivation of this result for r = 3 and then to introduce a generalization to nonequidimensional varieties. For the sake of clarity, we shall reformulate our problem as follows. Let Z be an equidimensional variety (maybe singular and/or reducible) of dimension n, other than a linear space, embedded into ℙ^r, where r ≥ n + 1. The variety of trisecant lines of Z, say V _1,3(Z), has dimension strictly less than 2n, unless Z is included in an (n + 1)-dimensional linear space and has degree at least 3, in which case dim V _1,3(Z) = 2n. This also implies that if dim V _1,3(Z) = 2n, then Z can be embedded in ℙ ^{n + 1}. Then we inquire the more general case, where Z is not required to be equidimensional. In that case, let Z be a possibly singular variety of dimension n, which may be neither irreducible nor equidimensional, embedded into ℙ^r, where r ≥ n + 1, and let Y be a proper subvariety of dimension k ≥ 1. Consider now S being a component of maximal dimension of the closure of . We show that S has dimension strictly less than n + k, unless the union of lines in S has dimension n + 1, in which case dim S = n + k. In the latter case, if the dimension of the space is strictly greater than n + 1, then the union of lines in S cannot cover the whole space. This is the main result of our paper. We also introduce some examples showing that our bound is strict. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 12, No. 2, pp. 71–87, 2006.     

On the general additive divisor problem

We obtain a new upper bound for the sum Σ _h≤H Δ _k (N, h) when 1 ≤ H ≤ N, k ∈ ℕ, k ≥ 3, where Δ _k (N, h) is the (expected) error term in the asymptotic formula for Σ _N<n≤2N d _k (n)d _k (n + h), and d _k (n) is the divisor function generated by ζ(s) ^k . When k = 3, the result improves, for H ≥ N ^1/2, the bound given in a recent work of Baier, Browning, Marasingha and Zhao, who dealt with the case k = 3.