Zuber's polynomiality conjecture for FPL configurations with nested arches
Let be a fixed non-crossing matching with arches, and let be the matching obtained from by adding nested arches. Let denote the number of fully packed loop configurations having as their associated matching. Associate to a Ferrers diagram , and write for its size and for the dimension of the irreducible representation of the symmetric group indexed by it.
Zuber's conjecture. The number is
where is a polynomial of degree with integer coefficients, whose highest-degree coefficient is .
References
Status
- Solved: Florian Aigner. Fully Packed Loop Configurations: Polynomiality and Nested Arches (The Electronic Journal of Combinatorics, 2018) https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p27
Source: Fabrizio Caselli, Christian Krattenthaler, Bodo Lass and Philippe Nadeau, “On the number of fully packed loop configurations with a fixed associated matching”, arXiv:math/0502392 (2005).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.