2000 character limit reached
A generalization of Aztec diamond theorem, part I
Published 2 Oct 2013 in math.CO | (1310.0851v2)
Abstract: We generalize Aztec diamond theorem (N. Elkies, G. Kuperberg, M. Larsen, and J. Propp, Alternating-sign matrices and domino tilings, Journal Algebraic Combinatoric, 1992) by showing that the numbers of tilings of a certain family of regions in the square lattice with southwest-to-northeast diagonals drawn in are given by powers of 2. We present a proof for the generalization by using a bijection between domino tilings and non-intersecting lattice paths.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.