English
Related papers

Related papers: 2-enumerations of halved alternating sign matrices

200 papers

We prove the equality of doubly refined enumerations of Alternating Sign Matrices and of Totally Symmetric Self-Complementary Plane Partitions using integral formulae originating from certain solutions of the quantum Knizhnik--Zamolodchikov…

Combinatorics · Mathematics 2008-03-12 T. Fonseca , P. Zinn-Justin

We use the subgraph replacement method to investigate new properties of the tilings of regions on the square lattice with diagonals drawn in. In particular, we show that the centrally symmetric tilings of a generalization of the Aztec…

Combinatorics · Mathematics 2019-05-20 Tri Lai

This paper highlights three known identities, each of which involves sums over alternating sign matrices. While proofs of all three are known, the only known derivations are as corollaries of difficult results. The simplicity and natural…

Combinatorics · Mathematics 2007-05-23 David M. Bressoud

Di Francesco conjectured in 2021 that the number of domino tilings of a certain family of regions -- called Aztec triangles -- on the square lattice is given by a product formula reminiscent of the one giving the number of alternating sign…

Combinatorics · Mathematics 2025-08-07 Seok Hyun Byun , Mihai Ciucu

Zeilberger proved the Refined Alternating Sign Matrix Theorem, which gives a product formula, first conjectured by Mills, Robbins and Rumsey, for the number of alternating sign matrices with given top row. Stroganov proved an explicit…

Combinatorics · Mathematics 2009-06-19 Matan Karklinsky , Dan Romik

We analyze domino tilings of the two-periodic Aztec diamond by means of matrix valued orthogonal polynomials that we obtain from a reformulation of the Aztec diamond as a non-intersecting path model with periodic transition matrices. In a…

Probability · Mathematics 2022-07-06 Maurice Duits , Arno B. J. Kuijlaars

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…

Combinatorics · Mathematics 2009-04-15 Ilse Fischer , Dan Romik

We give a bijective proof of the Aztec diamond theorem, stating that there are $2^{n(n+1)/2}$ domino tilings of the Aztec diamond of order $n$. The proof in fact establishes a similar result for non-intersecting families of $n+1$ Schr\"oder…

Combinatorics · Mathematics 2012-09-25 Frédéric Bosio , Marc A. A. Van Leeuwen

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…

Combinatorics · Mathematics 2019-05-22 Jessica Striker

We consider square matrices A that commute with a fixed square matrix K, both with entries in a field F not of characteristic 2. When K^2=I, Tao and Yasuda defined A to be generalized centrosymmetric with respect to K. When K^2=-I, we…

Combinatorics · Mathematics 2007-07-09 Christopher R. H. Hanusa

In this paper we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal…

Combinatorics · Mathematics 2025-09-04 Seok Hyun Byun , Mihai Ciucu , Yi-Lin Lee

We compute the number of perfect matchings of an $M\times N$ Aztec rectangle where $|N-M|$ vertices have been removed along a line. A particular case solves a problem posed by Propp. Our enumeration results follow from certain identities…

Combinatorics · Mathematics 2007-05-23 Christian Krattenthaler

This paper explores the connection between perfect t-embeddings and the octahedron equation in the setting of the two-periodic Aztec diamond. In particular, we show that the positions of both the t-embedding and the corresponding origami…

Mathematical Physics · Physics 2025-08-20 Tomas Berggren , Marianna Russkikh

This note derives the characteristic polynomial of a graph that represents nonjump moves in a generalized game of checkers. The number of spanning trees is also determined.

Combinatorics · Mathematics 2008-02-03 Donald E. Knuth

This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.

Combinatorics · Mathematics 2007-05-23 Peter E. John , Horst Sachs

Since the alternating sign matrix conjecture, proposed by Mills, Robbins, and Rumsey in 1982, was proved by Zeilberger and Kuperberg, several refined enumerations have been considered. In particular, Behrend et al. obtained a quadruply…

Combinatorics · Mathematics 2026-01-19 Guo-Niu Han , Lihong Yang

We explore the connections between the well-studied Aztec Diamond graphs and a new family of graphs called the Half-Hexagons, discovered by Jonathan Novak. In particular, both families of graphs have very simple domino shuffling algorithms,…

Combinatorics · Mathematics 2011-03-28 Eric Nordenstam , Benjamin Young

We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data arising from the representation of an ASM as a collection of…

Combinatorics · Mathematics 2007-05-23 Benjamin Wieland

Motivated in part by Propp's intruded Aztec diamond regions, we consider hexagonal regions out of which two horizontal chains of triangular holes (called ferns) are removed, so that the chains are at the same height, and are attached to the…

Combinatorics · Mathematics 2019-05-20 Mihai Ciucu , Tri Lai

The p-adic valuations of a sequence of integers T(n) counting alternating sign matrices is examined for p=2 and p=3. Symmetry properties of their graphs produce a new proof of the result that characterizes the indices for which T(n) is odd.

Number Theory · Mathematics 2009-01-30 Xinyu Sun , Victor H. Moll