Let g1, g2, …, gn be a sequence of mutually independent, normally distributed, random variables with mathematical expectation zero and variance unity. In this work, we obtain the average number of real zeros of the random algebraic equations Σnk=1 Kσ gk(ω)tk = C, where C is a constant independent of t and not necessarily zero. This average is (1/π) log n, when n is large and σ is non-negative.

Using a technique of Agarwal and Andrews (1987), bijective proofs of some n-color partition identities discovered recently by the author, are given.

Nous obtenons différentes identités de l'analyse combinatoire contenant des coefficients binomiaux de Gauss.

The quintuple product identity has appeared many times in the literature. Indeed, no fewer than 12 proofs have been given. We establish a more general identity from which the quintuple product identity follows in two ways.

We consider certain affine Kac-Moody Lie algebras. We give a Lie theoretic interpretation of the generalized Euler identities by showing that they are associated with certain filtrations of the basic representations of these algebras. In the case when the algebras have prime rank, we also give algebraic proofs of the corresponding identities.

Let X1, X2, …, Xn be identically distributed independent random variables belonging to the domain of attraction of the normal law, have zero means and Pr{Xr ≠ 0} > 0. Suppose a0, a1, …, an are non-zero real numbers and max and εn is such that as n → ∞, εn. If Nn be the number of real roots of the equation then for n > n0, Nn > εn log n outside an exceptional set of measure at most provided limn→∞ (kn/tn) is finite.

Let ℱ be a set of m subsets of X = {1,2,…, n}. We study the maximum number λ of containments Y ⊂ Z with Y, Z ∊ ℱ. Theorem 9. , if, and only if, ml/n → 1. When n is large and members of ℱ have cardinality k or k–1 we determine λ. For this we bound (ΔN)/N where ΔN is the shadow of Kruskal's k-cascade for the integer N. Roughly, if m ∼ N + ΔN, then λ ∼ kN with infinitely many cases of equality. A by-product is Theorem 7 of LYM posets.

Some generalizations of Sperner's theorem and of the LYM inequality are given to the case when A1,… At are t families of subsets of {1,…,m} such that a set in one family does not properly contain a set in another.

In [10] the following generalization of the Erdös–Ko–Rado [6] theorem was proved:

If 1 ≤ h ≤ m/2 andare r sets of h-subsets of {1,…, m} such that

then

Let 〈fn≧0 be nonnegative real numbers with generating function f(x) = Σfnxn. Assume f(x) has the following properties: it has a finite nonzero radius of convergence x0 with its only singularity on the circle of convergence at x = x0 and f(x0) converges to y0; y = f(x) satisfies an analytic identity F(x, y) = 0 near (x0, y0); Fy(l) (x0, y0)= 0, 0 ≦ i < k and Fy(k) (x0, y0) ≠ 0. There are constants γ, a positive rational, and c such that fn~cx0−n n−(1 +ggr;). Furthermore, we show (i) in all cases how to determine γ and c from f(x) and (ii) in certain cases how to determine them from F(x, y).

A permutation π of the set {1, 2, …, n} is four-discordant if π(i) ≢ i, i+ 1, i + 2, i +3 (mod n) for 1 ≦i ≦ n. Generating functions for rook polynomials associated with four-discordant permutations are derived. Hit polynomials associated with four-discordant permutations are studied. Finally, it is shown that the leading coefficients of these rook polynomials form a “tribonacci” sequence which is a generalized Fibonacci sequence.

Let P be a finite, connected partially ordered set containing no crowns and let Q be a subset of P. Then the following conditions are equivalent: (1) Q is a retract of P; (2) Q is the set of fixed points of an order-preserving mapping of P to P; (3) Q is obtained from P by dismantling by irreducibles.

In this paper we prove two analogues of the following theorem:

If is a collection of distinct subsets of {1, …, m} such that , i ≠ j ⇒ Ai ∩ Aj ≠ ∅, Ai ∪ Aj ≠ {1, …, m} then .

An asymptotic expansion is obtained for this sequence, of interest in combinatorial analysis. Values are given for the constants appearing in the leading term and a numerical comparison made.

The letters a, b, n, m, t (perhaps with suffixes) always denote natural numbers. A, B, S denote finite sets of natural numbers. |A| stands for the cardinality of A.

For a given constant c > 1 we say that the set A has property α(c) if there are at most c|A| differences a − b ≥ 0 for a, b ∈ A.

A. J. W. Hilton [5] conjectured that if P, Q are collections of subsets of a finite set S, with |S| = n, and |P| > 2n−2, |Q| ≥ 2n−2, then for some A ∈ P, B ∈ Q we have A ⊆ B or B ⊆ A. We here show that this assertion, indeed a stronger one, can be deduced from a result of D. J. Kleitman. We then give another proof of a recent result also proved by Lovász and by Schönheim.

Let En+1, for some integer n ≥ 0, be the (n + 1)-dimensional Euclidean space, and denote by Sn the standard n–sphere in En+1, . It is convenient to introduce the (–1)-dimensional sphere , where denotes the empty set. By an i-dimensional subsphere T of Sn, i = 0 n, we understand the intersection of Sn with some (i+1)-dimensional subspace of En+1. The affine hull of T always contains, with this definition, the origin of En+1. is the unique (–1)-dimensional subsphere of Sn. By the spherical hull, sph X, of a set , we understand the intersection of all subspheres of Sn containing X. Further we set dim X: = dim sph X. The interior, the boundary and the complement of an arbitrary set , with respect to Sn, shall be denoted by int X, bd X and cpl X. Finally we define the relative interior rel int X to be the interior of with respect to the usual topology sphZ . For each (n–1)-dimensional subsphere of Sn defines two closed hemispheres of Sn, whose common boundary it is. The two hemispheres of the sphere Sº are denned to be the two one-pointed subsets of Sº. A subset is called a closed (spherical) polytope, if it is the intersection of finitely many closed hemispheres, and, if, in addition, it does not contain a subsphere of Sn. is called an i-dimensional, relatively open polytope, , or shortly an i-open polytope, if there exists a closed polytope such that dim P = i and Q = rel int P. is called a closed polyhedron, if it is a finite union of closed polytopes P1 …, Pr. The empty set is the only (–1)-dimensional closed polyhedron of Sn. We denote by the set of all closed polyhedra of Sn. is called an i-open polyhedron, for some , if there are finitely many i-open polytopes Q1 …, Qr in Sn such that , and dim . By we denote the set of all i-open polyhedra. Clearly for all , and each i-dimensional subsphere of Sn, , belongs to and to , For each i-dimensional subsphere T of Sn, set . A map is defined by , for all , and, for all .

In [1], A. H. Stone proved that for a cardinal number k ≥ 1 a set with a transitive relation can be partitioned into k cofinal subsets provided each element of the set has at least k successors. Using methods quite different from those of Stone, we show that for k ≥ ℵ0 the same condition on successors guarantees that a set on which there are defined not more than k transitive relations can be partitioned into k sets each of which is cofinal with respect to each of the relations. We also show that such a partition exists even if some of the relations are not transitive as long as the non-transitive relations have no more than k elements.