[Paper Review] Doubly-refined enumeration of Alternating Sign Matrices and determinants of 2-staircase Schur functions

Philippe Biane, Luigi Cantini+1 more|arXiv (Cornell University)|Jan 18, 2011

Advanced Combinatorial Mathematics18 references5 citations

TL;DR

This paper establishes a determinantal identity for Schur functions associated with 2-staircase diagrams, proving a novel non-linear relation between the determinant of doubly-refined alternating sign matrix (ASM) enumeration matrices and the number of ASMs of smaller size. The key result is that $\det(\mathcal{A}^n) = (-A_{n-1})^{n-3}$, which provides a new, non-linear structural identity in ASM enumeration, derived via connections to the 6-vertex model and compound determinants of Schur functions.

ABSTRACT

We prove a determinantal identity concerning Schur functions for 2-staircase diagrams lambda=(ln+l',ln,l(n-1)+l',l(n-1),...,l+l',l,l',0). When l=1 and l'=0 these functions are related to the partition function of the 6-vertex model at the combinatorial point and hence to enumerations of Alternating Sign Matrices. A consequence of our result is an identity concerning the doubly-refined enumerations of Alternating Sign Matrices.

Motivation & Objective

• To establish a determinantal identity for Schur functions on 2-staircase diagrams, particularly for the case $\ell=1$, $\ell'=0$, which connects to the partition function of the 6-vertex model.
• To derive a new non-linear relation between the doubly-refined enumeration of alternating sign matrices and the total count $A_n$.
• To prove that the determinant of the doubly-refined ASM matrix $\mathcal{A}^n$ satisfies $\det(\mathcal{A}^n) = (-A_{n-1})^{n-3}$, a result of non-linear, variable-degree nature.
• To generalize and prove conjectures on compound determinants and wheel conditions in symmetric functions, using induction and degree bounds.

Proposed method

• The authors use a multivariate generating function approach rooted in the 6-vertex model, where the weight function $\mu_n(B; \vec{x}, \vec{y}, q)$ is factorized over matrix entries.
• They analyze symmetric functions $P(\vec{z})$ satisfying a generalized $(m,\ell)$-wheel condition, which encode the structure of the ASM enumeration matrices.
• A key technique involves the use of Bazin's theorem on compound determinants to relate the determinant of $\mathcal{A}^n$ to Schur functions of 2-staircase diagrams.
• The proof proceeds by induction on $N$, the number of variables, using degree bounds on symmetric polynomials and their specializations.
• The authors derive bounds on the degrees $D_w(F)$, $d_w(F)$, and $d_m(F)$ of the symmetric function $F$ in the context of wheel conditions, leading to a uniqueness argument.
• By comparing degree bounds for $m$ and $m-1$ cases and showing strict inequalities in the degree function $f_{m,\ell}(D,d)$, they conclude that the difference polynomial $R(\vec{z})$ must vanish, proving the identity.

Experimental results

Research questions

• RQ1 What is the determinant of the doubly-refined enumeration matrix $\mathcal{A}^n$ for alternating sign matrices?
• RQ2 How are Schur functions on 2-staircase diagrams related to the partition function of the 6-vertex model at the combinatorial point?
• RQ3 Can a non-linear determinant identity be established for $\mathcal{A}^n$ that generalizes the known linear refinements of $A_n$?
• RQ4 What role do compound determinants and wheel conditions play in characterizing symmetric functions arising from ASM enumeration?
• RQ5 Is the identity $\det(\mathcal{A}^n) = (-A_{n-1})^{n-3}$ provable via symmetric function theory and degree-based uniqueness arguments?

Key findings

• The determinant of the doubly-refined ASM matrix $\mathcal{A}^n$ is given by $\det(\mathcal{A}^n) = (-A_{n-1})^{n-3}$, a non-linear relation with degree growing with $n$.
• For $n=2$, $\det(\mathcal{A}^2) = -1 = -1^{-1}$, and for $n=3$, $\det(\mathcal{A}^3) = 1 = 2^0$, consistent with the formula.
• For $n=4$, $\det(\mathcal{A}^4) = -7 = -7^1$, and for $n=5$, $\det(\mathcal{A}^5) = 1764 = 42^2$, both matching $(-A_{n-1})^{n-3}$.
• The result is derived as a corollary of a general identity on Schur functions for 2-staircase diagrams $\lambda = (\ell n + \ell', \ell n, \dots, \ell + \ell', \ell, \ell', 0)$.
• The proof relies on degree bounds and induction, showing that the difference between the symmetric function $P$ and the Schur function $s_{N,m,\ell}$ must vanish due to strict inequalities in the degree function $f_{m,\ell}(D,d)$.
• The authors confirm that the constant $c_K$ in the specialization $F^{(K)}_{N,m,\ell} = c_K s_{N-m,m,\ell}$ is independent of $K$, ensuring consistency across specializations.