Sciweavers

Share
COMBINATORICS
2004

On the Counting of Fully Packed Loop Configurations: Some New Conjectures

8 years 5 months ago
On the Counting of Fully Packed Loop Configurations: Some New Conjectures
New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures are based on the analysis of the ground state of the Temperley-Lieb chain, for periodic boundary conditions and so-called "identified connectivities", up to size 2n = 22.
Jean-Bernard Zuber
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where COMBINATORICS
Authors Jean-Bernard Zuber
Comments (0)
books