Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients

From MaRDI portal
Publication:388732

DOI10.1016/J.JCTA.2013.08.006zbMATH Open1278.05061arXiv1112.0202OpenAlexW2106419197MaRDI QIDQ388732FDOQ388732


Authors: Philippe Nadeau Edit this on Wikidata


Publication date: 6 January 2014

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

Abstract: In this work we continue our study of Fully Packed Loop (FPL) configurations in a triangle. These are certain subgraphs on a triangular subset of the square lattice, which first arose in the study of the usual FPL configurations on a square grid. We show that, in a special case, the enumeration of these FPLs in a triangle is given by Littlewood-Richardson coefficients. The proof consists of a bijection with Knutson-Tao puzzles.


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




Recommendations




Cites Work


Cited In (14)





This page was built for publication: Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients

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