ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let α(n;k1,…,kn)\alpha(n;k_1,\ldots,k_n) denote the generalized monotone-triangle enumeration, and let n≥1n\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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.