Triangular fully packed loop configurations of excess 2

preprint2015arXivOpen access

Abstract

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)(u,v;w) of 0101-words encoding its boundary conditions which must necessarily satisfy that d(u)+d(v)≤d(w)d(u)+d(v)\leq d(w), where d(u)d(u) denotes the number of inversions in uu. Wieland gyration, on the other hand, was invented to show the rotational invariance of the numbers AπA_π of FPLs corresponding to a given link pattern ππ. Later, Wieland drift - a map on TFPLs that is based on Wieland gyration - was defined. The main contribution of this article is a linear expression for the number of TFPLs with boundary (u,v;w)(u,v;w) where d(w)−d(u)−d(v)=2d(w)-d(u)-d(v)=2 in terms of numbers of stable TFPLs, that is, TFPLs invariant under Wieland drift. This linear expression is consistent with already existing enumeration results for TFPLs with boundary (u,v;w)(u,v;w) where d(w)−d(u)−d(v)=0,1d(w)-d(u)-d(v)=0,1.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.