Related papers: Multiply-refined enumeration of alternating sign m…
It was shown recently by the authors that, for any n, there is equality between the distributions of certain triplets of statistics on nxn alternating sign matrices (ASMs) and descending plane partitions (DPPs) with each part at most n. The…
The refined enumeration of alternating sign matrices (ASMs) of given order having prescribed behavior near one or more of their boundary edges has been the subject of extensive study, starting with the Refined Alternating Sign Matrix…
We obtain a new expression for the partition function of the 8VSOS model with domain wall boundary conditions, which we consider to be the natural extension of the Izergin-Korepin formula for the six-vertex model. As applications, we find…
Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We put ASMs into a larger context by studying the order ideals of subposets of a…
Alternating Sign Matrix(ASM for short) is a square matrix which is consist of 0, 1 and -1. In this paper, we characterize an ASM by showing a bijection between alternating sign matrix and six vertex model, and a bijection between six vertex…
We prove refined enumeration results on several symmetry classes as well as related classes of alternating sign matrices with respect to classical boundary statistics, using the six-vertex model of statistical physics. More precisely, we…
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and…
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and…
An Alternating Sign Matrix (ASM) is a square matrix with entries in $\{0,1,-1\}$, and such that: $i)$ in each row and columns, nonzero entries alternate in sign; $ii)$ for any given row or column, entries sum up to 1. We define the…
In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers…
We study {\em sign-restricted matrices} (SRMs), a class of rectangular $(0, \pm 1)$-matrices generalizing the alternating sign matrices (ASMs). In an SRM each partial column sum, starting from row 1, equals 0 or 1, and each partial row sum,…
For each $\alpha \in \{0,1,-1 \}$, we count diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order with a maximal number of $\alpha$'s along the diagonal and the antidiagonal, as well as DASASMs of…
We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model…
Vertically symmetric alternating sign matrices (VSASMs) of order $2n+1$ are known to be equinumerous with lozenge tilings of a hexagon with side lengths $2n+2$, $2n$, $2n+2$, $2n$, $2n+2$, $2n$ and a central triangular hole of size $2$ that…
We study a further refinement of the standard refined enumeration of alternating sign matrices (ASMs) according to their first two rows instead of just the first row, and more general "d-refined" enumerations of ASMs according to the first…
In a previous article [math.CO/9712207], we derived the alternating-sign matrix (ASM) theorem from the Izergin-Korepin determinant for a partition function for square ice with domain wall boundary. Here we show that the same argument…
An alternating sign matrix is a square matrix with entries 1, 0 and -1 such that the sum of the entries in each row and each column is equal to 1 and the nonzero entries alternate in sign along each row and each column. To some of the…
Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We present a unifying perspective on ASMs and other combinatorial objects by studying…
The enumeration of diagonally symmetric alternating sign matrices (DSASMs) is studied, and a Pfaffian formula is obtained for the number of DSASMs of any fixed size, where the entries for the Pfaffian are positive integers given by simple…
An alternating sign matrix, or ASM, is a $(0, \pm 1)$-matrix where the nonzero entries in each row and column alternate in sign. We generalize this notion to hypermatrices: an $n\times n\times n$ hypermatrix $A=[a_{ijk}]$ is an {\em…