De Finetti Lattices and Magog Triangles

The order ideal $B_{n,2}$ of the Boolean lattice $B_n$ consists of all subsets of size at most $2$. Let $F_{n,2}$ denote the poset refinement of $B_{n,2}$ induced by the rules: $i < j$ implies $\{i \} \prec \{ j \}$ and $\{i,k \} \prec \{j,k\}$. We give an elementary bijection from the set $\mathcal{F}_{n,2}$ of linear extensions of $F_{n,2}$ to the set of shifted standard Young tableau of shape $(n, n-1, \ldots, 1)$, which are counted by the strict-sense ballot numbers. We find a more surprising result when considering the set $\mathcal{F}_{n,2}^{1}$ of minimal poset refinements in which each singleton is comparable with all of the doubletons. We show that $\mathcal{F}_{n,2}^{1}$ is in bijection with magog triangles, and therefore is equinumerous with alternating sign matrices. We adopt our proof techniques to show that row reversal of an alternating sign matrix corresponds to a natural involution on gog triangles.

A Bijective Proof of the ASM Theorem Part II: ASM Enumeration and ASM–DPP Relation

This paper is the 2nd in a series of planned papers that provide 1st bijective proofs of alternating sign matrix (ASM) results. Based on the main result from the 1st paper, we construct a bijective proof of the enumeration formula for ASMs and of the fact that ASMs are equinumerous with descending plane partitions. We are also able to refine these bijections by including the position of the unique $1$ in the top row of the matrix. Our constructions rely on signed sets and related notions. The starting point for these constructions were known “computational” proofs, but the combinatorial point of view led to several drastic modifications. We also provide computer code where all of our constructions have been implemented.

Alternating Sign Matrices and Polynomiography

To each permutation matrix we associate a complex permutation polynomial with roots at lattice points corresponding to the position of the ones. More generally, to an alternating sign matrix (ASM) we associate a complex alternating sign polynomial. On the one hand visualization of these polynomials through polynomiography, in a combinatorial fashion, provides for a rich source of algorithmic art-making, interdisciplinary teaching, and even leads to games. On the other hand, this combines a variety of concepts such as symmetry, counting and combinatorics, iteration functions and dynamical systems, giving rise to a source of research topics. More generally, we assign classes of polynomials to matrices in the Birkhoff and ASM polytopes. From the characterization of vertices of these polytopes, and by proving a symmetry-preserving property, we argue that polynomiography of ASMs form building blocks for approximate polynomiography for polynomials corresponding to any given member of these polytopes. To this end we offer an algorithm to express any member of the ASM polytope as a convex of combination of ASMs. In particular, we can give exact or approximate polynomiography for any Latin Square or Sudoku solution. We exhibit some images.

The Alternating Sign Matrix Polytope

We define the alternating sign matrix polytope as the convex hull of $n\times n$ alternating sign matrices and prove its equivalent description in terms of inequalities. This is analogous to the well known result of Birkhoff and von Neumann that the convex hull of the permutation matrices equals the set of all nonnegative doubly stochastic matrices. We count the facets and vertices of the alternating sign matrix polytope and describe its projection to the permutohedron as well as give a complete characterization of its face lattice in terms of modified square ice configurations. Furthermore we prove that the dimension of any face can be easily determined from this characterization.

Higher Spin Alternating Sign Matrices

We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer $r$, all complete row and column sums are $r$, and all partial row and column sums extending from each end of the row or column are nonnegative. Such matrices correspond to configurations of spin $r/2$ statistical mechanical vertex models with domain-wall boundary conditions. The case $r=1$ gives standard alternating sign matrices, while the case in which all matrix entries are nonnegative gives semimagic squares. We show that the higher spin alternating sign matrices of size $n$ are the integer points of the $r$-th dilate of an integral convex polytope of dimension $(n{-}1)^2$ whose vertices are the standard alternating sign matrices of size $n$. It then follows that, for fixed $n$, these matrices are enumerated by an Ehrhart polynomial in $r$.