Indexed metadata
On the Number of Fully Packed Loop Configurations with a Fixed Associated Matching
F. Caselli, C. Krattenthaler, B. Lass, P. Nadeau
Source abstract
We show that the number of fully packed loop configurations corresponding to a matching with nested arches is polynomial in if is large enough, thus essentially proving two conjectures by Zuber [Electronic J. Combin. 11(1) (2004), Article #R13].
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.