Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients
From MaRDI portal
(Redirected from Publication:388732)
Abstract: In this work we continue our study of Fully Packed Loop (FPL) configurations in a triangle. These are certain subgraphs on a triangular subset of the square lattice, which first arose in the study of the usual FPL configurations on a square grid. We show that, in a special case, the enumeration of these FPLs in a triangle is given by Littlewood-Richardson coefficients. The proof consists of a bijection with Knutson-Tao puzzles.
Recommendations
- Fully packed loop configurations in a triangle and Littlewood Richardson coefficients
- A conjectured formula for fully packed loop configurations in a triangle
- Fully packed loop configurations in a triangle
- On the counting of fully packed loop configurations: some new conjectures
- Refined counting of fully packed loop configurations
- On some polynomials enumerating fully packed loop configurations
- Some combinatorics of rhomboid-shaped fully packed loop configurations
- Fully packed loop configurations: polynomiality and nested arches
- Fully packed loop configurations: polynomiality and nested arches
- Fully packed loops in a triangle: matchings, paths and puzzles
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- A conjectured formula for fully packed loop configurations in a triangle
- Combinatorial nature of the ground-state vector of the \(\mathrm{O}(1)\) loop model
- Fully packed loop configurations in a triangle
- Fully packed loop configurations in a triangle and Littlewood Richardson coefficients
- Fully packed loops in a triangle: matchings, paths and puzzles
- On the counting of fully packed loop configurations: some new conjectures
- On the number of fully packed loop configurations with a fixed associated matching
- Proof of the Razumov-Stroganov conjecture
- Puzzles and (equivariant) cohomology of Grassmannians
- Refined counting of fully packed loop configurations
- The honeycomb model of 𝐺𝐿_{𝑛}(ℂ) tensor products II: Puzzles determine facets of the Littlewood-Richardson cone
Cited in
(14)- On some polynomials enumerating Fully Packed Loop configurations: evaluation at negative values
- On the number of fully packed loop configurations with a fixed associated matching
- On the counting of fully packed loop configurations: some new conjectures
- Proof of two conjectures of Zuber on fully packed loop configurations
- Fully packed loop configurations in a triangle and Littlewood Richardson coefficients
- Some combinatorics of rhomboid-shaped fully packed loop configurations
- Triangular fully packed loop configurations of excess 2
- DHD-puzzles
- Littlewood-Richardson coefficients via mirror symmetry for cluster varieties
- A bijection between classes of fully packed loops and plane partitions
- Wieland drift for triangular fully packed loop configurations
- Combinatorics of hexagonal fully packed loop configurations
- Fully packed loop configurations in a triangle
- Fully packed loops in a triangle: matchings, paths and puzzles
This page was built for publication: Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388732)