Sabine Beil - Triangular fully packed loop configurations of excess 2

dmtcs:2487 - Discrete Mathematics & Theoretical Computer Science, January 1, 2015, DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015) - https://doi.org/10.46298/dmtcs.2487
Triangular fully packed loop configurations of excess 2Article

Authors: Sabine Beil 1

  • 1 Fakultät für Mathematik [Wien]

Triangular fully packed loop configurations (TFPLs) came up in the study of fully packed loop configurations on a square (FPLs) corresponding to link patterns with a large number of nested arches. To a TFPL is assigned a triple $(u,v;w)$ of $01$-words encoding its boundary conditions. A necessary condition for the boundary $(u,v;w)$ of a TFPL is $\lvert \lambda(u) \rvert +\lvert \lambda(v) \rvert \leq \lvert \lambda(w) \rvert$, where $\lambda(u)$ denotes the Young diagram associated with the $01$-word $u$. Wieland gyration, on the other hand, was invented to show the rotational invariance of the numbers $A_\pi$ of FPLs corresponding to a given link pattern $\pi$. Later, Wieland drift was defined as the natural adaption of Wieland gyration to TFPLs. The main contribution of this article is a linear expression for the number of TFPLs with boundary $(u,v;w)$ where $\lvert \lambda (w) \rvert - \lvert\lambda (u) \rvert - \lvert \lambda (v)\rvert \leq 2$ in terms of numbers of stable TFPLs that is TFPLs invariant under Wieland drift. These stable TFPLs have boundary $(u^{+},v^{+};w)$ for words $u^{+}$ and $v^{+}$ such that $\lambda (u) \subseteq \lambda (u^{+})$ and $\lambda (v) \subseteq \lambda (v^{+})$.


Volume: DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Section: Proceedings
Published on: January 1, 2015
Imported on: November 21, 2016
Keywords: Triangular fully packed loop configurations,Wieland drift,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
    Source : OpenAIRE Graph
  • Compact enumeration formulas for generalized partitions; Code: Y 463

Consultation statistics

This page has been seen 261 times.
This article's PDF has been downloaded 447 times.