REVIEW 1 cited by
A bijective proof of the ASM theorem, Part II: ASM enumeration and ASM-DPP relation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for alternating sign matrices and of the fact that alternating sign matrices are equinumerous with descending plane partitions. We are also able to refine these bijections by including the position of the unique $1$ in the top row of the matrix. Our constructions rely on signed sets and related notions. The starting point for these constructions were known ``computational'' proofs, but the combinatorial point of view led to several drastic modifications. We also provide computer code where all of our constructions have been implemented.
Forward citations
Cited by 1 Pith paper
-
Frozen-corner enumeration of Alternating Sign Matrices
The number of ASMs with an s by s frozen zero corner is conjectured to equal A_n det(1-M), a determinant formula verified numerically for all n up to 20.
Discussion (0). Continue with ORCID to comment.