More refined enumerations of alternating sign matrices (Q1034085)

An alternating sign matrix (ASM) of order \(n\) is an \(n\times n\) matrix with entries from \(\{0, 1, -1\}\), such that in every row and column the sum of entries is 1, and the non-zero entries appear with alternating signs. The celebrated alternating sign matrix theorem counts the number of ASM's, \(A_n\), in an elegant product form, and the refined alternating sign matrix theorem counts the number of ASM's with a 1 in the \(k^{th}\) position in the first row, \(A_{n,k}\), in a product form. The current paper studies potential extension of the refined alternating sign matrix theorem with respect to 2 (or \(d\)) rows. However, the exact conditions for the rows are complicated, and are more natural in the setting of the enumeration of complete monotone triangles, an equivalent problem.