Half-turn symmetric FPLs with rare couplings and tilings of hexagons
Jean-Christophe Aval (LaBRI), Philippe Duchon (LaBRI, INRIA Bordeaux -, Sud-Ouest)

TL;DR
This paper establishes a formula linking fully packed loop configurations to half-turn symmetric FPLs, revealing surprising connections with plane partitions and hexagon tilings, supported by bijective proofs and enumerative analysis.
Contribution
It introduces a new formula relating FPLs with specific couplings to symmetric variants, and uncovers novel enumerative coincidences involving tilings and symmetry classes.
Findings
Number of HTFPLs with certain couplings equals cyclically-symmetric plane partitions.
Bijection proof connecting FPL configurations to plane partitions.
Discovery of new coincidences in tiling counts and FPL enumerations.
Abstract
In this work, we put to light a formula that relies the number of fully packed loop configurations (FPLs) associated to a given coupling pi to the number of half-turn symmetric FPLs (HTFPLs) of even size whose coupling is a punctured version of the coupling pi. When the coupling pi is the coupling with all arches parallel pi0 (the "rarest" one), this formula states the equality of the number of corresponding HTFPLs to the number of cyclically-symmetric plane partition of the same size. We provide a bijective proof of this fact. In the case of HTFPLs odd size, and although there is no similar expression, we study the number of HTFPLs whose coupling is a slit version of pi_0, and put to light new puzzling enumerative coincidence involving countings of tilings of hexagons and various symmetry classes of FPLs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · graph theory and CDMA systems · Finite Group Theory Research
