Fully packed loops in a triangle: matchings, paths and puzzles

DOI10.1016/J.JCTA.2014.10.008MaRDI QIDQ476290zbMATH OpenOpenAlexWikidataFDO

Authors Ilse Fischer, Philippe Nadeau

Publication date 28 November 2014

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.1262

zbMATH Keywords

lattice pathsLittlewood-Richardson coefficientsfully packed loop configurationsKnutson-Tao puzzlesalternating sign matrices

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of tessellation and tiling problems (05B45)

Abstract: Fully Packed Loop configurations in a triangle (TFPLs) first appeared in the study of ordinary Fully Packed Loop configurations (FPLs) on the square grid where they were used to show that the number of FPLs with a given link pattern that has m nested arches is a polynomial function in m. It soon turned out that TFPLs possess a number of other nice properties. For instance, they can be seen as a generalized model of Littlewood-Richardson coefficients. We start our article by introducing oriented versions of TFPLs; their main advantage in comparison with ordinary TFPLs is that they involve only local constraints. Three main contributions are provided. Firstly, we show that the number of ordinary TFPLs can be extracted from a weighted enumeration of oriented TFPLs and thus it suffices to consider the latter. Secondly, we decompose oriented TFPLs into two matchings and use a classical bijection to obtain two families of nonintersecting lattice paths (path tangles). This point of view turns out to be extremely useful for giving easy proofs of previously known conditions on the boundary of TFPLs necessary for them to exist. One example is the inequality d(u)+d(v)<=d(w) where u,v,w are 01-words that encode the boundary conditions of ordinary TFPLs and d(u) is the number of cells in the Ferrers diagram associated with u. In the third part we consider TFPLs with d(w)- d(u)-d(v)=0,1; in the first case their numbers are given by Littlewood-Richardson coefficients, but also in the second case we provide formulas that are in terms of Littlewood-Richardson coefficients. The proofs of these formulas are of a purely combinatorial nature.

Recommendations

• Fully packed loop configurations in a triangle and Littlewood Richardson coefficients
• Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients
• Triangular fully packed loop configurations of excess 2
• Fully packed loop configurations in a triangle
• Triangular fully packed loop configurations of excess 2

Cites work

• scientific article; zbMATH DE number 3861336 (Why is no real title available?)
• scientific article; zbMATH DE number 16115 (Why is no real title available?)
• scientific article; zbMATH DE number 1741012 (Why is no real title available?)
• scientific article; zbMATH DE number 1380572 (Why is no real title available?)
• A conjectured formula for fully packed loop configurations in a triangle
• A large dihedral symmetry of the set of alternating sign matrices
• Alternating-sign matrices and domino tilings. I
• Binomial determinants, paths, and hook length formulae
• Combinatorial aspects of the \(K\)-theory of Grassmannians
• Combinatorial nature of the ground-state vector of the \(\mathrm{O}(1)\) loop model
• Double-dimer pairings and skew Young diagrams
• Fully packed loop configurations in a triangle
• Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients
• Integrability and combinatorics: selected topics
• Littlewood-Richardson coefficients and integrable tilings
• On Representatives of Subsets
• On some polynomials enumerating fully packed loop configurations
• On the counting of fully packed loop configurations: some new conjectures
• On the number of fully packed loop configurations with a fixed associated matching
• Path representation of maximal parabolic Kazhdan-Lusztig polynomials.
• Polygons Have Ears
• Proof of the Razumov-Stroganov conjecture
• Proofs of two conjectures of Kenyon and Wilson on Dyck tilings
• Puzzles and (equivariant) cohomology of Grassmannians
• Puzzles, tableaux, and mosaics
• Refined counting of fully packed loop configurations
• The honeycomb model of 𝐺𝐿_{𝑛}(ℂ) tensor products II: Puzzles determine facets of the Littlewood-Richardson cone

Cited in

(16)

• Combinatorics of hexagonal fully packed loop configurations
• Half-turn symmetric FPLs with rare couplings and tilings of hexagons
• DHD-puzzles
• Wieland drift for triangular fully packed loop configurations
• Proof of two conjectures of Zuber on fully packed loop configurations
• The space of circular planar electrical networks
• Fully packed loop configurations in a triangle and Littlewood Richardson coefficients
• Triangular fully packed loop configurations of excess 2
• Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients
• Fully packed loop configurations in a triangle
• Triangular fully packed loop configurations of excess 2
• Some combinatorics of rhomboid-shaped fully packed loop configurations
• Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
• On the number of fully packed loop configurations with a fixed associated matching
• Generalized Dyck tilings
• Dyck tilings, increasing trees, descents, and inversions

This page was built for publication: Fully packed loops in a triangle: matchings, paths and puzzles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476290)