[Paper Review] Combinatorial nature of ground state vector of O(1) loop model

A. V. Razumov, Yu. G. Stroganov|ArXiv.org|Apr 24, 2001

Theoretical and Computational Physics4 references79 citations

TL;DR

This paper proposes a conjecture linking the ground state vector of the dense O(1) loop model to the combinatorics of fully packed loop (FPL) model states and alternating sign matrices (ASMs). It shows that the components of the eigenvector corresponding to the largest eigenvalue of the Hamiltonian—defined via link-pattern-preserving operators h_i—equal the number of FPL states for each link-pattern, establishing a deep combinatorial structure underlying the model's ground state.

ABSTRACT

Hanging about a hypothetical connections between the ground state vector for some special spin systems and the alternating-sign matrices, we have found a numerical evidence for the fact that the numbers of the states of the fully packed loop model with fixed link-patterns coincide with the components of the ground state vector of the dense O$(1)$ loop model considered by Batchelor, de Gier and Nienhuis. Our conjecture generalizes in a sense the conjecture of Bosley and Fidkowski, refined by Cohn and Propp, and proved by Wieland.

Motivation & Objective

• To establish a combinatorial interpretation of the components of the ground state vector in the dense O(1) loop model.
• To explore the connection between the FPL model’s link-pattern statistics and the eigenvectors of the O(1) loop model Hamiltonian.
• To generalize prior conjectures on ASM enumeration and link-pattern symmetry by Wieland and Cohn-Propp.
• To demonstrate that the ground state vector's components correspond exactly to the number of FPL states per link-pattern.

Proposed method

• Define the FPL model on an n×n grid with domain-wall boundary conditions, where states are fully packed loop configurations.
• Introduce link-patterns as non-crossing pairings of 2n boundary vertices, with each pattern corresponding to a unique FPL state.
• Define operators h_i that act on link-patterns by locally modifying adjacent pairings, preserving the overall structure.
• Construct the Hamiltonian H = ∑ h_i as a linear operator acting on the space of link-patterns.
• Form the vector Ψ = ∑ π A_n(π) π, where A_n(π) is the number of FPL states with link-pattern π.
• Show that HΨ = 2nΨ if and only if ∑_i ∑_{π': h_i(π')=π} A_n(π') = 2n A_n(π), leading to the central conjecture.

Experimental results

Research questions

• RQ1 Do the components of the ground state vector of the dense O(1) loop model correspond to the number of FPL states for each link-pattern?
• RQ2 Is the eigenvector of the Hamiltonian H with eigenvalue 2n unique and equal to the vector Ψ defined via ASM enumeration?
• RQ3 Does the invariance of the Hamiltonian under rotations and reflections imply that the ground state vector must respect the same symmetries?
• RQ4 Can the conjecture that A_n(π) = A_n(π') for link-patterns related by symmetry be generalized to the full eigenvector structure?
• RQ5 Is there a dynamical or game-theoretic interpretation where both players have equal winning probability regardless of initial state?

Key findings

• For n=4, the vector Ψ has components (7,7,3,3,3,3,3,3,3,3,1,1,1,1), matching the number of FPL states per link-pattern as listed in Table 1.
• The Hamiltonian H has row sums equal to 8 = 2n, confirming that 2n is the spectral radius and that Ψ is an eigenvector with eigenvalue 2n.
• The game-theoretic formulation shows that both players have equal winning probability (1/6 for n=4), supporting the conjecture that HΨ = 2nΨ.
• The conjecture generalizes Wieland’s proof of the Bosley-Fidkowski-Cohn-Propp conjecture on link-pattern symmetry and ASM enumeration.
• The eigenvector Ψ is conjectured to be the unique eigenvector corresponding to the largest eigenvalue 2n, supported by numerical verification up to n=7.
• The Hamiltonian H preserves rotational and reflectional symmetries, and the ground state vector must inherit these symmetries, consistent with the observed component structure.