BdGN's largest-entry conjecture for the open B model
BdGN's largest-entry conjecture for the open B model
From papers
At and in the homogeneous limit, let
be the ground-state eigenvector of the open-boundary Hamiltonian for the $B_r$ model, normalized so that its smallest entry is $1$. Let $A_V(r)$ denote the corresponding Vertically Symmetric Alternating Sign Matrix enumeration (with the even case identified with the relevant Cyclically Symmetric Transpose Complement Plane Partition enumeration). **BdGN's largest-entry conjecture.** The largest entry of, with arches connecting consecutive points, is . The sum-of-entries formula is established in the supplied discussion, whereas this largest-entry formula is presented as an unproved assertion.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
P. Di Francesco and P. Zinn-Justin, “From Orbital Varieties to Alternating Sign Matrices”, arXiv:math-ph/0512047 (2005).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.