A complete grammar for decomposing a family of graphs into 3-connected components.
A conjecture of Stanley on alternating permutations.
A conjectured formula for fully packed loop configurations in a triangle.
A continued fraction expansion for a -tangent function.
A Contribution to the Theory of Permutations
A criterion for unimodality.
A curious identity involving binomial coefficients.
A de Bruijn-type formula for enumerating patterns of partitions.
A density version of the Carlson–Simpson theorem
We prove a density version of the Carlson–Simpson Theorem. Specifically we show the following. For every integer and every set of words over satisfying there exist a word over and a sequence of left variable words over such that the set is contained in . While the result is infinite-dimensional its proof is based on an appropriate finite and quantitative version, also obtained in the paper.
A determinant identity that implies Rogers-Ramanujan.
A determinant of the Chudnovskys generalizing the elliptic Frobenius-Stickelberger-Cauchy determinantal identity.
A different -analogue of Euler numbers. (Un autre -analogue des nombres d'Euler.)
A direct bijective proof of the hook-length formula.
A discontinuity in the distribution of fixed point sums.
A divisibility property of binomial coefficients viewed as an elementary sieve.
A duality based proof of the combinatorial nullstellensatz.
A fast algorithm for MacMahon's partition analysis.
A Foata bijection for the alternating group and for -analogues.
A formula for the generating functions of powers of Horadam's sequence with two additional parameters.
A functional combinatorial central limit theorem.