Proof of two conjectures of Zuber on fully packed loop configurations
DOI10.1016/j.jcta.2004.06.006zbMath1054.05005arXivmath/0312217OpenAlexW2950960254WikidataQ123253518 ScholiaQ123253518MaRDI QIDQ1881686
Fabrizio Caselli, Christian Krattenthaler
Publication date: 14 October 2004
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0312217
Young tableauxrhombus tilingsplane partitionsnon-intersecting lattice pathsfully packed loop modelhook-content formula
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Exactly solvable models; Bethe ansatz (82B23) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- A large dihedral symmetry of the set of alternating sign matrices
- Enumeration of Lozenge tilings of hexagons with cut-off corners
- On the counting of fully packed loop configurations: some new conjectures
- A bijection between classes of fully packed loops and plane partitions
- Loops, matchings and alternating-sign matrices
- Combinatorial nature of the ground-state vector of the \(\mathrm{O}(1)\) loop model
- Exact expressions for correlations in the ground state of the dense O(1) loop model
- The Problem of the Calissons
- Critical behaviour of the fully packed loop model on the square lattice
- Theory and Application of Plane Partitions. Part 2
- Enumeration of Lozenge tilings of hexagons with a central triangular hole
- Lattice path proofs for determinantal formulas for symplectic and orthogonal characters
This page was built for publication: Proof of two conjectures of Zuber on fully packed loop configurations