Refined Counting of Fully Packed Loop Configurations
2007 (English)In: Séminaire Lotharingien de Combinatoire, ISSN 1286-4889, Vol. 56, 1-27 p.Article in journal (Refereed) Published
We give a generalisation of a conjecture by Propp on a summation formula for fully packed loop configurations. The original conjecture states that the number of configurations in which each external edge is connected to its neighbour is equal to the total number of configurations of size one less. This conjecture was later generalised by Zuber to include more types of configurations. Our conjecture further refines the counting and provides a general framework for some other summation formulas observed by Zuber. It also implies similar summation formulas for half-turn symmetric configurations.
Place, publisher, year, edition, pages
2007. Vol. 56, 1-27 p.
IdentifiersURN: urn:nbn:se:liu:diva-12703OAI: oai:DiVA.org:liu-12703DiVA: diva2:16886