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

DOI10.1016/J.JCTA.2014.10.008zbMATH Open1303.05006arXiv1209.1262OpenAlexW2136699077WikidataQ59196571 ScholiaQ59196571MaRDI QIDQ476290FDOQ476290

Authors: Ilse Fischer, Philippe Nadeau 

Publication date: 28 November 2014

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

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.

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

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

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)

Cites Work

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

Cited In (16)

• Half-turn symmetric FPLs with rare couplings and tilings of hexagons
• On the number of fully packed loop configurations with a fixed associated matching
• 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
• Some combinatorics of rhomboid-shaped fully packed loop configurations
• Triangular fully packed loop configurations of excess 2
• Triangular fully packed loop configurations of excess 2
• Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
• DHD-puzzles
• Wieland drift for triangular fully packed loop configurations
• Combinatorics of hexagonal fully packed loop configurations
• Dyck tilings, increasing trees, descents, and inversions
• Generalized Dyck tilings
• Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients
• Fully packed loop configurations in a triangle

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)