Fischer–Riegler conjecture for vertically symmetric alternating-sign matrices

From papers

Let α(n;k1,,kn)\alpha(n;k_1,\ldots,k_n) denote the generalized monotone-triangle enumeration, and let n1n\geq1. An alternating-sign matrix (ASM) is a square matrix with entries in {1,0,1}\{-1,0,1\} whose row and column sums are 11, with nonzero entries alternating in every row and column. Fischer–Riegler conjecture. The identity

α(2n+1;2n+1,2n,,1)=(1)nα(n;2,4,,2n)\alpha(2n+1;2n+1,2n,\ldots,1)=(-1)^n\alpha(n;2,4,\ldots,2n)

should hold; moreover, α(n;2,4,,2n)\alpha(n;2,4,\ldots,2n) counts vertically symmetric ASMs of size 2n+12n+1. This is one of several identities conjectured from computational evidence, and the source highlights the interest of finding bijective proofs.

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

Lukas Riegler, “Generalized Monotone Triangles: an extended Combinatorial Reciprocity Theorem”, arXiv:1207.4437 (2012).

Solutions 0

No solutions have been posted yet.