Yet another doubly refined enumeration of Alternating Sign Matrices

preprint2026arXivOpen access

Abstract

Since the alternating sign matrix conjecture, proposed by Mills, Robbins, and Rumsey in 1982, was proved by Zeilberger and Kuperberg, several refined enumerations have been considered. In particular, Behrend et al. obtained a quadruply refined enumeration by adding certain parameters. In this paper, we revisit the doubly refined enumeration of alternating sign matrices by adding three parameters: the number of −1-1's, the position of the 11 in the first row, and the position of the 11 in the last row. Using Lascoux's formula on symmetry functions, we derive a new determinantal formula for this doubly refined enumeration. Besides the enumeration conjecture, Mills et al. also proposed a decomposition conjecture, which was subsequently proven by Kuperberg. We present a refinement of that decomposition conjecture.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.