On the number of fully packed loop configurations with a fixed associated matching

MaRDI QIDQ1773148zbMATH OpenFDO

Authors Fabrizio Caselli, Philippe Nadeau, C. Krattenthaler, Bodo Lass

Publication date 25 April 2005

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0502392, https://eudml.org/doc/124412, http://www.emis.de/journals/EJC/Volume_11/Abstracts/v11i2r16.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of tessellation and tiling problems (05B45) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Exactly solvable models; Bethe ansatz (82B23)

Abstract: We show that the number of fully packed loop configurations corresponding to a matching with $m$ nested arches is polynomial in $m$ if $m$ is large enough, thus essentially proving two conjectures by Zuber [Electronic J. Combin. 11 (2004), Article #R13].

Review text

Summary: We show that the number of fully packed loop configurations corresponding to a matching with \(m\) nested arches is polynomial in \(m\) if \(m\) is large enough, thus essentially proving two conjectures by \textit{J.-B. Zuber} [Electron. J. Comb. 11, Research paper R13 (2004; Zbl 1054.05011)].

Recommendations

• 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
• Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients
• Fully packed loop configurations in a triangle and Littlewood Richardson coefficients
• Some combinatorics of rhomboid-shaped fully packed loop configurations
• Fully packed loops in a triangle: matchings, paths and puzzles
• Combinatorics of hexagonal fully packed loop configurations
• A conjectured formula for fully packed loop configurations in a triangle
• Fully packed loop configurations: polynomiality and nested arches

Cited in

(17)

• Fully packed loop configurations: polynomiality and nested arches
• On the counting of fully packed loop configurations: some new conjectures
• A bijection between classes of fully packed loops and plane partitions
• Wieland drift for triangular fully packed loop configurations
• On fully packed loop configurations with four sets of nested arches
• On some ground state components of the \(O(1)\) loop model
• Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients
• Fully packed loop configurations in a triangle
• Half-turn symmetric FPLs with rare couplings and tilings of hexagons
• On some polynomials enumerating Fully Packed Loop configurations: evaluation at negative values
• Fully packed loops in a triangle: matchings, paths and puzzles
• Combinatorics of hexagonal fully packed loop configurations
• Fully packed loop configurations: polynomiality and nested arches
• DHD-puzzles
• Proof of the Razumov-Stroganov conjecture
• On some polynomials enumerating fully packed loop configurations
• Triangular fully packed loop configurations of excess 2

This page was built for publication: On the number of fully packed loop configurations with a fixed associated matching

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