A formula for a doubly refined enumeration of alternating sign matrices
From MaRDI portal
(Redirected from Publication:972855)
Abstract: Zeilberger proved the Refined Alternating Sign Matrix Theorem, which gives a product formula, first conjectured by Mills, Robbins and Rumsey, for the number of alternating sign matrices with given top row. Stroganov proved an explicit formula for the number of alternating sign matrices with given top and bottom rows. Fischer and Romik considered a different kind of "doubly-refined enumeration" where one counts alternating sign matrices with given top two rows, and obtained partial results on this enumeration. In this paper we continue the study of the doubly-refined enumeration with respect to the top two rows, and use Stroganov's formula to prove an explicit formula for these doubly-refined enumeration numbers.
Recommendations
- Multiply-refined enumeration of alternating sign matrices
- Doubly-refined enumeration of alternating sign matrices and determinants of 2-staircase Schur functions
- More refined enumerations of alternating sign matrices
- A doubly-refined enumeration of alternating sign matrices and descending plane partitions
- On the doubly refined enumeration of alternating sign matrices and totally symmetric self-complementary plane partitions
- Refined enumerations of some symmetry classes of alternating-sign matrices
- Linear relations of refined enumerations of alternating sign matrices
- 2-enumerations of halved alternating sign matrices
- On the refined 3-enumeration of alternating sign matrices
- Refined enumeration of symmetry classes of alternating sign matrices
Cites work
- A new proof of the refined alternating sign matrix theorem
- Alternating sign matrices and descending plane partitions
- scientific article; zbMATH DE number 425775 (Why is no real title available?)
- scientific article; zbMATH DE number 1380572 (Why is no real title available?)
- scientific article; zbMATH DE number 892258 (Why is no real title available?)
- Izergin-Korepin determinant at a third root of unity
- More refined enumerations of alternating sign matrices
- On two-point boundary correlations in the six-vertex model with domain wall boundary conditions
- Proof of the alternating sign matrix conjecture
- Proof of the refined alternating sign matrix conjecture
- Refined enumerations of alternating sign matrices: Monotone \((d,m)\)-trapezoids with prescribed top and bottom row
- The number of monotone triangles with prescribed bottom row
Cited in
(15)- On the doubly refined enumeration of alternating sign matrices and totally symmetric self-complementary plane partitions
- More refined enumerations of alternating sign matrices
- Enumerations of half-turn-symmetric alternating-sign matrices of odd order
- \(q\)-enumeration of alternating sign matrices with exactly one \(-1\)
- A doubly-refined enumeration of alternating sign matrices and descending plane partitions
- New enumeration formulas for alternating sign matrices and square ice partition functions
- Refined enumeration of symmetry classes of alternating sign matrices
- Multiply-refined enumeration of alternating sign matrices
- Doubly-refined enumeration of alternating sign matrices and determinants of 2-staircase Schur functions
- On the refined 3-enumeration of alternating sign matrices
- Factorization in the multirefined tangent method
- Refined enumerations of alternating sign matrices: Monotone \((d,m)\)-trapezoids with prescribed top and bottom row
- On the weighted enumeration of alternating sign matrices and descending plane partitions
- Linear relations of refined enumerations of alternating sign matrices
- A new proof of the refined alternating sign matrix theorem
This page was built for publication: A formula for a doubly refined enumeration of alternating sign matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972855)
