Fully packed loop configurations in a triangle

From MaRDI portal
Publication:388736

DOI10.1016/J.JCTA.2013.08.007zbMATH Open1278.05062arXiv1111.6027OpenAlexW1999113194MaRDI QIDQ388736FDOQ388736


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: Fully Packed Loop configurations (FPLs) are certain configurations on the square grid, naturally refined according to certain link patterns. If AX is the number of FPLs with link pattern X, the Razumov--Stroganov correspondence provides relations between numbers AX relative to a given grid size. In another line of research, if Xcupp denotes X with p additional nested arches, then AXcupp was shown to be polynomial in p: the proof gives rise to certain configurations of FPLs in a triangle (TFPLs). In this work we investigate these TFPL configurations and their relation to FPLs. We prove certain properties of TFPLs, and enumerate them under special boundary conditions. From this study we deduce a class of linear relations, conjectured by Thapper, between quantities AX relative to different grid sizes, relations which thus differ from the Razumov--Stroganov ones.


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




Recommendations




Cites Work


Cited In (14)

Uses Software





This page was built for publication: Fully packed loop configurations in a triangle

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