2000 character limit reached
Fully Packed Loop configurations in a Triangle and Littlewood-Richardson coefficients (1112.0202v1)
Published 1 Dec 2011 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.