A method for proving polynomial enumeration formulas
From MaRDI portal
Publication:2484506
DOI10.1016/j.jcta.2004.11.007zbMath1066.05011arXivmath/0301103OpenAlexW2049480943WikidataQ59196593 ScholiaQ59196593MaRDI QIDQ2484506
Publication date: 1 August 2005
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0301103
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)
Related Items (9)
The mysterious story of square ice, piles of cubes, and bijections ⋮ The number of monotone triangles with prescribed bottom row ⋮ A bijective proof of the ASM theorem. I: The operator formula ⋮ The first bijective proof of the refined ASM theorem ⋮ Alternating sign matrices and totally symmetric plane partitions ⋮ The operator formula for monotone triangles - simplified proof and three generalizations ⋮ Sequences of labeled trees related to Gelfand-Tsetlin patterns ⋮ Short proof of the ASM theorem avoiding the six-vertex model ⋮ Computations versus bijections for tiling enumeration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of the Bender-Knuth conjecture
- Alternating sign matrices and descending plane partitions
- Plane partitions. II: The equivalence of the Bender-Knuth and MacMahon conjectures
- A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
- Proof of the refined alternating sign matrix conjecture
- The enumeration of totally symmetric plane partitions
- Bruhat lattices, plane partition generating functions, and minuscule representations
- New symmetric plane partition identities from invariant theory work of De Concini and Procesi
- Enumeration of plane partitions
- Vicious walkers, friendly walkers and Young tableaux: II. With a wall
- Hall-Littlewood Functions, Plane Partitions, and the Rogers-Ramanujan Identities
- The major counting of nonintersecting lattice paths and generating functions for tableaux
- Schützenberger's jeu de taquin and plane partitions
This page was built for publication: A method for proving polynomial enumeration formulas