This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Alternating sign matrices | |
|---|---|
| Name | Alternating sign matrices |
| Field | Combinatorics, Statistical mechanics |
| Introduced | 1980s |
| Notable contributors | Doron Zeilberger, Greg Kuperberg, David Robbins, Howard Rumsey, William Mills |
Alternating sign matrices are square arrays of entries 0, 1, and −1 with row and column sums equal to 1 and nonzero entries in each row and column alternating in sign. These matrices arose in enumerative Combinatorics and have deep links to Statistical mechanics, Representation theory, Algebraic combinatorics, Integrable systems, and problems posed by figures such as Dorothy Robinson and David Robbins. Their study connects to conjectures and theorems proven by researchers including Doron Zeilberger and Greg Kuperberg and to objects studied by William Mills and Howard Rumsey.
An alternating sign matrix of order n is an n×n array with entries in {0,1,−1} satisfying: each row and column sums to 1; in each row and column the nonzero entries alternate in sign, beginning and ending with 1 when present. Basic properties include closure under transposition, constraints on positions of 1s and −1s, and bijections with objects exhibiting similar sign alternation patterns studied in Representation theory and Enumerative combinatorics. Structural results exploit permutation matrices studied by Cauchy and Birkhoff and use techniques from work by Gian-Carlo Rota and Richard Stanley.
For n=1 the unique matrix is the 1×1 matrix [1]; for n=2 there are exactly 2 matrices corresponding to the two permutation matrices of S_2; for n=3 there are 7 matrices, a sequence noted by David Robbins and Neil Sloane in early tabulations. Small-case enumeration and concrete examples are often illustrated alongside studies by William Mills, David Robbins, and Howard Rumsey and appear in expositions by Richard Stanley and Pierre Leroux.
The enumeration problem asks for the number A(n) of alternating sign matrices of order n. The famous ASM conjecture proposed an explicit product formula for A(n), a conjecture formulated in the context of enumerative questions considered by David Robbins and Howard Rumsey. The conjecture was proved independently by Doron Zeilberger using computer-aided proofs and by Greg Kuperberg using methods from Statistical mechanics and the six-vertex model inspired by work of Ludwig Faddeev and Rodney Baxter. The product formula involves factorials and binomial coefficients reminiscent of identities studied by André Weil and Gustav Herglotz and links to determinant evaluations of the kind treated by Carl Gustav Jacob Jacobi and Arthur Cayley.
Alternating sign matrices are in bijection with several classes of combinatorial structures: totally symmetric self-complementary plane partitions studied by Richard Stanley and William Mills; monotone triangles connected to Gelfand–Tsetlin patterns and work of Israel Gelfand; and configurations of the six-vertex model analyzed by R.J. Baxter and Elliott Lieb. They relate to permutation matrices indexed by S_n elements, to objects in Young tableau theory associated to Alfred Young, and to tilings and plane partitions considered by P. MacMahon and George Andrews.
Refined enumerations classify alternating sign matrices by symmetry types: vertically symmetric, horizontally symmetric, dihedral-symmetric, and cyclic-symmetric classes studied by David Robbins and Neil Sloane and further analyzed by Mills, Robbins, and Rumsey. Each symmetry class yields distinct product formulas or conjectural counts, paralleling work on symmetric plane partitions by John H. Conway and H.S.M. Coxeter. Research by Greg Kuperberg and Doron Zeilberger used tools from group actions by Coxeter groups and characters from Representation theory to obtain refined enumeration results for several symmetry classes.
Algebraic frameworks interpret alternating sign matrices via the Yang–Baxter equation and integrable models developed by Ludwig Faddeev, Alexander Zamolodchikov, and Rodney Baxter. Kuperberg’s proof exploited the six-vertex model and partition functions akin to constructs in Quantum groups and Exactly solvable models. Connections to the Izergin–Korepin determinant link to determinants studied by G.N. Watson and to transfer-matrix techniques used in analyses by Baxter and Elliott Lieb. Representation-theoretic perspectives invoke Schur functions associated to Isaai Schur and symmetric function theory advanced by Richard Stanley.
Open problems include refined asymptotics for A(n) akin to questions addressed by Gian-Carlo Rota and precise bijective proofs connecting ASM bijections to plane partitions sought by researchers following the discoveries of Mills, Robbins, and Rumsey. Recent developments involve refined limit shapes studied using probabilistic methods popularized by Persi Diaconis and Oded Schramm, algebraic proofs leveraging Quantum groups by followers of Vladimir Drinfeld, and computational enumerations extended by contemporary contributors in Enumerative combinatorics. Active directions also explore connections to knot invariants linked to work by Edward Witten and to categorification programs influenced by Mikhail Khovanov.