A formula for a doubly refined enumeration of alternating sign matrices

DOI10.1016/J.AAM.2009.11.005zbMATH Open1226.05025arXiv0906.3405OpenAlexW2028869788MaRDI QIDQ972855FDOQ972855

Dan Romik, Matan Karklinsky

Publication date: 21 May 2010

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0906.3405

zbMATH Keywords

enumerative combinatoricssix-vertex modelalternating sign matrixsquare ice

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proof of the alternating sign matrix conjecture
• Alternating sign matrices and descending plane partitions
• Proof of the refined alternating sign matrix conjecture
• The number of monotone triangles with prescribed bottom row
• On two-point boundary correlations in the six-vertex model with domain wall boundary conditions
• Refined enumerations of alternating sign matrices: Monotone \((d,m)\)-trapezoids with prescribed top and bottom row
• More refined enumerations of alternating sign matrices
• A new proof of the refined alternating sign matrix theorem
• Izergin-Korepin determinant at a third root of unity

Cited In (9)

• \(q\)-enumeration of alternating sign matrices with exactly one \(-1\)
• On the weighted enumeration of alternating sign matrices and descending plane partitions
• Refined enumerations of alternating sign matrices: Monotone \((d,m)\)-trapezoids with prescribed top and bottom row
• Refined enumeration of symmetry classes of alternating sign matrices
• Multiply-refined enumeration of alternating sign matrices
• Enumerations of half-turn-symmetric alternating-sign matrices of odd order
• Linear relations of refined enumerations of alternating sign matrices
• A doubly-refined enumeration of alternating sign matrices and descending plane partitions
• Factorization in the multirefined tangent method

Uses Software

• ROBBINS

Recommendations

• Linear relations of refined enumerations of alternating sign matrices 👍 👎
• On the doubly refined enumeration of alternating sign matrices and totally symmetric self-complementary plane partitions 👍 👎
• More refined enumerations of alternating sign matrices 👍 👎
• A doubly-refined enumeration of alternating sign matrices and descending plane partitions 👍 👎
• Refined enumerations of some symmetry classes of alternating-sign matrices 👍 👎
• Multiply-refined enumeration of alternating sign matrices 👍 👎
• On the refined 3-enumeration of alternating sign matrices 👍 👎
• Refined enumeration of symmetry classes of alternating sign matrices 👍 👎
• Doubly-refined enumeration of alternating sign matrices and determinants of 2-staircase Schur functions 👍 👎
• 2-enumerations of halved alternating sign matrices 👍 👎

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)