Get started
Work

On Propp's Problem 12: The Sum of the Entries of the Inverse Kasteleyn–Percus Matrix of the Aztec Diamond

Year: 2026
Type: preprint
Abstract: Let K_n be the Kasteleyn–Percus matrix of the Aztec diamond of order n: the adjacency matrix between its black and its white squares in which the entry of every vertical domino whose white square is on top is replaced by −1. In Problem 12 of his list of open problems in the enumeration of matchings (1996, revised 1998; the sign convention is fixed in the version of 1999, where the problem is still open), J. Propp asked for a proof that the sum of the entries of K_n⁻¹ is (n − 1)(n + 3)/2 − 2ⁿ⁻¹ + 2, a formula he had checked for n ≤ 8. We prove it for every n ≥ 1. The matrix K_n maps the constant function 1/2 on the white squares to the constant 1, except on one edge of the diamond; in coordinates rotated by 45° the remaining equation has an explicit solution whose values are the Krawtchouk coefficients −(1/2)[ξᵐ](1 − ξ)ᵏ(1 + ξ)ⁿ⁻ᵏ, and two transpositions reduce the entry sum to n(n + 1)/2 + n/2 − (2ⁿ − 1)/2 = (n + 1)²/2 − 2ⁿ⁻¹. The argument also gives every row sum and every column sum of K_n⁻¹ as an explicit Krawtchouk coefficient. The problem and the formula are Propp's; the matrix and the determinant method are due to Kasteleyn and Percus; the Aztec diamond and the number 2^(n(n+1)/2) of its domino tilings to Elkies, Kuperberg, Larsen and Propp; explicit formulas for the individual entries of the inverse, as sums of products of Krawtchouk coefficients, to Helfgott (1998, posted 2000), whose coupling function differs from the inverse by an explicit sign factor, extended to different weights for horizontal and vertical dominoes by Chhita, Johansson and Young. These works do not compute the entry sum or the row sums. What the note adds is an elementary proof of Propp's formula and the row and column sums. Computations show that the entry sum depends on the choice of the Kasteleyn signs, so that the convention of the 1999 text is essential. This is an unrefereed note. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifier: AMR-122-0012 (J. Propp, Twenty open problems in enumeration of matchings, arXiv:math/9801060, Problem 12; Enumeration of matchings: problems and progress, Math. Sci. Res. Inst. Publ. 38 (1999), Problem 12).
DOI: 10.5281/zenodo.23445963
Language: English
Open Access status: green
OpenAlex ID: W7222870865
Cites:
Cited by:
Related to: