615 research outputs found
Level Eulerian Posets
The notion of level posets is introduced. This class of infinite posets has
the property that between every two adjacent ranks the same bipartite graph
occurs. When the adjacency matrix is indecomposable, we determine the length of
the longest interval one needs to check to verify Eulerianness. Furthermore, we
show that every level Eulerian poset associated to an indecomposable matrix has
even order. A condition for verifying shellability is introduced and is
automated using the algebra of walks. Applying the Skolem--Mahler--Lech
theorem, the -series of a level poset is shown to be a rational
generating function in the non-commutative variables and .
In the case the poset is also Eulerian, the analogous result holds for the
-series. Using coalgebraic techniques a method is developed to
recognize the -series matrix of a level Eulerian poset
On the weighted enumeration of alternating sign matrices and descending plane partitions
We prove a conjecture of Mills, Robbins and Rumsey [Alternating sign matrices
and descending plane partitions, J. Combin. Theory Ser. A 34 (1983), 340-359]
that, for any n, k, m and p, the number of nxn alternating sign matrices (ASMs)
for which the 1 of the first row is in column k+1 and there are exactly m -1's
and m+p inversions is equal to the number of descending plane partitions (DPPs)
for which each part is at most n and there are exactly k parts equal to n, m
special parts and p nonspecial parts. The proof involves expressing the
associated generating functions for ASMs and DPPs with fixed n as determinants
of nxn matrices, and using elementary transformations to show that these
determinants are equal. The determinants themselves are obtained by standard
methods: for ASMs this involves using the Izergin-Korepin formula for the
partition function of the six-vertex model with domain-wall boundary
conditions, together with a bijection between ASMs and configurations of this
model, and for DPPs it involves using the Lindstrom-Gessel-Viennot theorem,
together with a bijection between DPPs and certain sets of nonintersecting
lattice paths.Comment: v2: published versio
Analytic urns
This article describes a purely analytic approach to urn models of the
generalized or extended P\'olya-Eggenberger type, in the case of two types of
balls and constant ``balance,'' that is, constant row sum. The treatment starts
from a quasilinear first-order partial differential equation associated with a
combinatorial renormalization of the model and bases itself on elementary
conformal mapping arguments coupled with singularity analysis techniques.
Probabilistic consequences in the case of ``subtractive'' urns are new
representations for the probability distribution of the urn's composition at
any time n, structural information on the shape of moments of all orders,
estimates of the speed of convergence to the Gaussian limit and an explicit
determination of the associated large deviation function. In the general case,
analytic solutions involve Abelian integrals over the Fermat curve x^h+y^h=1.
Several urn models, including a classical one associated with balanced trees
(2-3 trees and fringe-balanced search trees) and related to a previous study of
Panholzer and Prodinger, as well as all urns of balance 1 or 2 and a sporadic
urn of balance 3, are shown to admit of explicit representations in terms of
Weierstra\ss elliptic functions: these elliptic models appear precisely to
correspond to regular tessellations of the Euclidean plane.Comment: Published at http://dx.doi.org/10.1214/009117905000000026 in the
Annals of Probability (http://www.imstat.org/aop/) by the Institute of
Mathematical Statistics (http://www.imstat.org
- …