17,633 research outputs found
Plane overpartitions and cylindric partitions
Generating functions for plane overpartitions are obtained using various
methods such as nonintersecting paths, RSK type algorithms and symmetric
functions. We extend some of the generating functions to cylindric partitions.
Also, we show that plane overpartitions correspond to certain domino tilings
and we give some basic properties of this correspondence.Comment: 42 pages, 11 figures, corrected typos, revised parts, figures
redrawn, results unchange
Random sampling of plane partitions
This article presents uniform random generators of plane partitions according
to the size (the number of cubes in the 3D interpretation). Combining a
bijection of Pak with the method of Boltzmann sampling, we obtain random
samplers that are slightly superlinear: the complexity is in
approximate-size sampling and in exact-size sampling
(under a real-arithmetic computation model). To our knowledge, these are the
first polynomial-time samplers for plane partitions according to the size
(there exist polynomial-time samplers of another type, which draw plane
partitions that fit inside a fixed bounding box). The same principles yield
efficient samplers for -boxed plane partitions (plane partitions
with two dimensions bounded), and for skew plane partitions. The random
samplers allow us to perform simulations and observe limit shapes and frozen
boundaries, which have been analysed recently by Cerf and Kenyon for plane
partitions, and by Okounkov and Reshetikhin for skew plane partitions.Comment: 23 page
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
Refined Topological Vertex, Cylindric Partitions and the U(1) Adjoint Theory
We study the partition function of the compactified 5D U(1) gauge theory (in
the Omega-background) with a single adjoint hypermultiplet, calculated using
the refined topological vertex. We show that this partition function is an
example a periodic Schur process and is a refinement of the generating function
of cylindric plane partitions. The size of the cylinder is given by the mass of
adjoint hypermultiplet and the parameters of the Omega-background. We also show
that this partition function can be written as a trace of operators which are
generalizations of vertex operators studied by Carlsson and Okounkov. In the
last part of the paper we describe a way to obtain (q,t) identities using the
refined topological vertex.Comment: 40 Page
Multiply-refined enumeration of alternating sign matrices
Four natural boundary statistics and two natural bulk statistics are
considered for alternating sign matrices (ASMs). Specifically, these statistics
are the positions of the 1's in the first and last rows and columns of an ASM,
and the numbers of generalized inversions and -1's in an ASM. Previously-known
and related results for the exact enumeration of ASMs with prescribed values of
some of these statistics are discussed in detail. A quadratic relation which
recursively determines the generating function associated with all six
statistics is then obtained. This relation also leads to various new identities
satisfied by generating functions associated with fewer than six of the
statistics. The derivation of the relation involves combining the
Desnanot-Jacobi determinant identity with the Izergin-Korepin formula for the
partition function of the six-vertex model with domain-wall boundary
conditions.Comment: 62 pages; v3 slightly updated relative to published versio
A factorization theorem for lozenge tilings of a hexagon with triangular holes
In this paper we present a combinatorial generalization of the fact that the
number of plane partitions that fit in a box is equal to
the number of such plane partitions that are symmetric, times the number of
such plane partitions for which the transpose is the same as the complement. We
use the equivalent phrasing of this identity in terms of symmetry classes of
lozenge tilings of a hexagon on the triangular lattice. Our generalization
consists of allowing the hexagon have certain symmetrically placed holes along
its horizontal symmetry axis. The special case when there are no holes can be
viewed as a new, simpler proof of the enumeration of symmetric plane
partitions.Comment: 20 page
Enumeration of connected Catalan objects by type
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted
plane trees are four classes of Catalan objects which carry a notion of type.
There exists a product formula which enumerates these objects according to
type. We define a notion of `connectivity' for these objects and prove an
analogous product formula which counts connected objects by type. Our proof of
this product formula is combinatorial and bijective. We extend this to a
product formula which counts objects with a fixed type and number of connected
components. We relate our product formulas to symmetric functions arising from
parking functions. We close by presenting an alternative proof of our product
formulas communicated to us by Christian Krattenthaler which uses generating
functions and Lagrange inversion
- …