arXiv · cond-mat/0403268
On FPL configurations with four sets of nested arches
Abstract
The problem of counting the number of Fully Packed Loop (FPL) configurations with four sets of a,b,c,d nested arches is addressed. It is shown that it may be expressed as the problem of enumeration of tilings of a domain of the triangular lattice with a conic singularity. After reexpression in terms of non-intersecting lines, the Lindström-Gessel-Viennot theorem leads to a formula as a sum of determinants. This is made quite explicit when min(a,b,c,d)=1 or 2. We also find a compact determinant formula which generates the numbers of configurations with b=d.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
P. Di Francesco, J. -B. Zuber. 2004-03-18. On FPL configurations with four sets of nested arches. https://doi.org/10.1088/1742-5468%2F2004%2F06%2Fp06005
Cite the original work for its findings. Save a collection to share your selection of sources.