Partitions of the natural numbers into infinitely oscillating bases and nonbases

The setA of nonnegative integers is a basis if every sufficiently large integerx can be written in the formx=a+a′ witha, a′∈A. IfA is not a basis, then it is a nonbasis. We construct a partition of the natural numbers into a basisA and a nonbasisB such that, as random elements are moved one at a time fromA toB, fromB toA, fromA toB, …, the setA oscillates from basis to nonbasis to basis … and the setB oscillates simultaneously from nonbasis to basis to nonbasis…     

NON-EMPTY CROSS-2-INTERSECTING FAMILIES OF SUBSETS

Let Cdenote the set of all k-subests of an n-set.Assume Alohtain in Ca,and A lohtain in (A,B) is called a cross-2-intersecting family if |A B≥2 for and A∈A,B∈B.In this paper,the best upper bounds of the cardinalities for non-empty cross-2-intersecting familles of a-and b-subsets are obtained for some a and b,A new proof for a Frankl-Tokushige theorem[6] is also given.     

Affine cross-polytopes inscribed in a convex body

Let X be an affine cross-polytope, i.e., the convex hull of n segments A ₁ B ₁,…, A _n B _n in \mathbbRⁿ {\mathbb{R}^n} that have a common midpoint O and do not lie in a hyperplane. The affine flag F(X) of X is the chain O ∈ L ₁ ⊂⋯ ⊂ L _n = \mathbbRⁿ {\mathbb{R}^n} , where L _k is the k-dimensional affine hull of the segments A ₁ B ₁,…, A _k B _k , k ≤ n. It is proved that each convex body K ⊂ \mathbbRⁿ {\mathbb{R}^n} is circumscribed about an affine cross-polytope X such that the flag F(X) satisfies the following condition for each k ∈{2,…, n}:the (k−1)-planes of support at A _k and B _k to the body L _k ∩ K in the k-plane L _k are parallel to L _k −1.Each such X has volume at least V(K)/2 ^n(n−1)/2. Bibliography: 5 titles.     

On exactlym times covers

In this paper it is shown that if every integer is covered bya ₁+n ₁ℤ,…,a _k +n _k ℤ exactlym times then for eachn=1,…,m there exist at least ( _n ^m ) subsetsI of {1,…k} such that ∑ _{i ∈ I} 1/n _i equalsn. The bound ( _n ^m ) is best possible. Research supported by the National Nature Science Foundation of P.R. of China.     

A proof of snevily’s conjecture

We prove Snevily’s conjecture, which states that for any positive integer k and any two k-element subsets {a ₁, …, a _k } and {b ₁, …, b _k } of a finite abelian group of odd order there exists a permutation π ∈ S _k such that all sums a _i + b _π(i) (i ∈ [1, k]) are pairwise distinct.     

Ideal einstein,conformally flat and semi-symmetric immersions

Recently, B. Y. Chen introduced a new intrinsic invariant of a manifold, and proved that everyn-dimensional submanifold of real space formsR ^m (ε) of constant sectional curvature ε satisfies a basic inequality δ(n ₁,…,n _k )≤c(n ₁,…,n _k )H ²+b(n ₁,…,n _k )ε, whereH is the mean curvature of the immersion, andc(n ₁,…,n _k ) andb(n ₁,…,n _k ) are constants depending only onn ₁,…,n _k ,n andk. The immersion is calledideal if it satisfies the equality case of the above inequality identically for somek-tuple (n ₁,…,n _k ). In this paper, we first prove that every ideal Einstein immersion satisfyingn≥n ₁+…+n _k +1 is totally geodesic, and that every ideal conformally flat immersion satisfyingn≥n ₁+…+n _k +2 andk≥2 is also totally geodesic. Secondly we completely classify all ideal semi-symmetric hypersurfaces in real space forms. The author was supported by the NSFC and RFDP.     

Geodesics in Graphs,an Extremal Set Problem,and Perfect Hash Families

 A set U of vertices of a graph G is called a geodetic set if the union of all the geodesics joining pairs of points of U is the whole graph G. One result in this paper is a tight lower bound on the minimum number of vertices in a geodetic set. In order to obtain that result, the following extremal set problem is solved. Find the minimum cardinality of a collection 𝒮 of subsets of [n]={1,2,…,n} such that, for any two distinct elements x,y∈[n], there exists disjoint subsets A _x ,A _y ∈𝒮 such that x∈A _x and y∈A _y . This separating set problem can be generalized, and some bounds can be obtained from known results on families of hash functions. Received: May 19, 2000 Final version received: July 5, 2001     

Additive latin transversals

We prove that for every odd primep, everyk≤p and every two subsets A={a ₁, …,a _k } andB={b ₁, …,b _k } of cardinalityk each ofZ _p , there is a permutationπ ∈S _k such that the sumsa _i +b _π(i) (inZ _p ) are pairwise distinct. This partially settles a question of Snevily. The proof is algebraic, and implies several related results as well. Research supported in part by a State of New Jersey grant and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University.     

On the replications of certain multiplicative designs

Bounds on the number of row sums in ann×n, non-singular (0,1)-matrixA sarisfyingA ^tA=diag (k ₁-λ₁,…,k _n-λ_n),k _j>λ_j>0,λ₁=…=λ_e,λ_e+1=…=λ_n are obtained which extend previous results for such matrices.     

The total reducibility order of a polynomial in two variables

LetK be an algebraically closed field of characteristic zero. ForA ∈K[x, y] let σ(A) = {λ ∈K:A − λ is reducible}. For λ ∈ σ(A) letA − λ = ∏ _i=1 ^n(λ) A _iλ ^k _μ whereA _iλ are distinct primes. Let ϱ_λ(A) =n(λ) − 1 and let ρ(A) = Σ_λɛσ(A)ϱ_λ(A). The main result is the following: Theorem.If A ∈ K[x, y] is not a composite polynomial, then ρ(A) < degA.     

Possible numbers of positive entries of imprimitive nonnegative matrices

Zhan, X., Extremal numbers of positive entries of imprimitive nonnegative matrix, Linear Algebra Appl. (in press) has determined the maximum and minimum numbers of positive entries of imprimitive irreducible nonnegative matrices with a given imprimitivity index. Let σ( A ) denote the number of positive entries of a matrix A. Let M(n,?k) and m(n,?k) denote the maximum and minimum numbers of positive entries of imprimitive irreducible nonnegative matrices of order n with a given imprimitivity index k, respectively. In this article, we prove that for any positive integer d with m(n,k)≤ d?≤?M(n,k), there exists an n?×?n irreducible nonnegative matrix A with imprimitivity index k such that?σ?(A)=d.     

Bernstein Operators for Exponential Polynomials

Let L be a linear differential operator with constant coefficients of order n and complex eigenvalues λ ₀,…,λ _n . Assume that the set U _n of all solutions of the equation Lf=0 is closed under complex conjugation. If the length of the interval [a,b] is smaller than π/M _n , where M _n :=max {|Im λ _j |:j=0,…,n}, then there exists a basis p _n,k , k=0,…,n, of the space U _n with the property that each p _n,k has a zero of order k at a and a zero of order n−k at b, and each p _n,k is positive on the open interval (a,b). Under the additional assumption that λ ₀ and λ ₁ are real and distinct, our first main result states that there exist points a=t ₀<t ₁<⋅⋅⋅<t _n =b and positive numbers α ₀,…,α _n , such that the operator

Sphere and Dot Product Representations of Graphs

A graph G is a k-sphere graph if there are k-dimensional real vectors v ₁,…,v _n such that ij∈E(G) if and only if the distance between v _i and v _j is at most 1. A graph G is a k-dot product graph if there are k-dimensional real vectors v ₁,…,v _n such that ij∈E(G) if and only if the dot product of v _i and v _j is at least 1.     

Characterization of non-matrix varieties of associative algebras

A variety of associative algebras is called a non-matrix variety if it does not contain the algebra of 2 × 2 matrices over the base field K. There are some known characterizations of non-matrix varieties. We give some new characterizations in terms of properties of nilelements. Let V be a variety of associative algebras over an infinite field. Then the following conditions are equivalent: (1) V is a non-matrix variety, (2) any finitely generated algebra A ∈ V satisfies an identity of the form [x ₁, x ₂] … [x _2s−1, x _2s ] ≡ 0, (3) let A ∈ V; then for any nilelements a, b ∈ A, the element a + b is again a nilelement. Let E be the Grassmann algebra in countable many generators. We also give similar characterizations for non-matrix varieties over fields of characteristic zero that do not contain E or E ⊗ E.     

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.     

On the theorem of M Golomb

Let X ₁, …, X _n be compact spaces and X = X ₁ × … × X _n . Consider the approximation of a function ƒ ∈ C(X) by sums g ₁(x ₁)+…+g _n (x _n ), where g _i ∈ C(X _i ), i = 1, …, n. In [8], Golomb obtained a formula for the error of this approximation in terms of measures constructed on special points of X, called ‘projection cycles’. However, his proof had a gap, which was pointed out by Marshall and O’Farrell [15]. But the question if the formula was correct, remained open. The purpose of the paper is to prove that Golomb’s formula holds in a stronger form.     

Doubly stochastic matrix equations

It is shown that for real,m x n matricesA andB the system of matrix equationsAX=B, BY=A is solvable forX andY doubly stochastic if and only ifA=BP for some permutation matrixP. This result is then used to derive other equations and to characterize the Green’s relations on the semigroup Ω _n of alln x n doubly stochastic matrices. The regular matrices in Ω _n are characterized in several ways by use of the Moore-Penrose generalized inverse. It is shown that a regular matrix in Ω _n is orthostochastic and that it is unitarily similar to a diagnonal matrix if and only if it belongs to a subgroup of Ω _n . The paper is concluded with extensions of some of these results to the convex setS _n of alln x n nonnegative matrices having row and column sums at most one. His research was supported by the N. S. F. Grant GP-15943.     

Tracking and invariance problems for some classes of discrete delay systems

Consider the system with perturbation g _k ∈ ℝ ⁿ and output z _k = Cx _k . Here, A _k ,A _k ^(s) ∈ ℝ ^{n × n} , B _k ⁽¹⁾ ∈ ℝ ^{n × p} , B _k ⁽²⁾ ∈ ℝ ^{n × m} , C ∈ ℝ ^{p × n} . We construct a special Lyapunov-Krasovskii functional in order to synthesize controls u _k ⁽¹⁾ and u _k ⁽²⁾ for which the following properties are satisfied:

Transversals of additive Latin squares

LetA={a ₁, …,a _k} andB={b ₁, …,b _k} be two subsets of an Abelian groupG, k≤|G|. Snevily conjectured that, whenG is of odd order, there is a permutationπ ∈S _ksuch that the sums α _i +b _i , 1≤i≤k, are pairwise different. Alon showed that the conjecture is true for groups of prime order, even whenA is a sequence ofk<|G| elements, i.e., by allowing repeated elements inA. In this last sense the result does not hold for other Abelian groups. With a new kind of application of the polynomial method in various finite and infinite fields we extend Alon’s result to the groups (ℤ _p ) ^a and in the casek<p, and verify Snevily’s conjecture for every cyclic group of odd order. Supported by Hungarian research grants OTKA F030822 and T029759. Supported by the Catalan Research Council under grant 1998SGR00119. Partially supported by the Hungarian Research Foundation (OTKA), grant no. T029132.     

The Erdös-Jacobson-Lehel conjecture on potentiallyP k-graphic sequence is true

A variation in the classical Turan extrernal problem is studied. A simple graphG of ordern is said to have propertyPk if it contains a clique of sizek+1 as its subgraph. Ann-term nonincreasing nonnegative integer sequence π=(d₁, d₂,⋯, d₂) is said to be graphic if it is the degree sequence of a simple graphG of ordern and such a graphG is referred to as a realization of π. A graphic sequence π is said to be potentiallyP _k-graphic if it has a realizationG having propertyP _k . The problem: determine the smallest positive even number σ(k, n) such that everyn-term graphic sequence π=(d₁, d₂,…, d₂) without zero terms and with degree sum σ(π)=(d ₁+d ₂+ …+d ₂) at least σ(k,n) is potentially P_k-graphic has been proved positive. Project supported by the National Natural Science Foundation of China (Grant No. 19671077) and the Doctoral Program Foundation of National Education Department of China.