On the counting of fully packed loop configurations: some new conjectures (Q1883622)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the counting of fully packed loop configurations: some new conjectures
scientific article

    Statements

    On the counting of fully packed loop configurations: some new conjectures (English)
    0 references
    13 October 2004
    0 references
    Summary: New conjectures are proposed on the numbers of fully packed loop 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\).
    0 references
    0 references
    0 references
    0 references
    0 references
    alternating-sign matrices
    0 references
    Temperley-Lieb chain
    0 references
    0 references
    0 references