An Alternative Technique for Proving the Aztec Diamond Theorem and Other Applications
نویسنده
چکیده
A new technique, called the superimposition technique, is used to prove various combinatorial identities, including the Aztec Diamond Theorem. The technique involves superimposing matchings of a graph and a smaller subgraph, and then partitioning the united graph again into matchings of two subgraphs. Applications of the technique include weighted Aztec diamonds, holey Aztec rectangles, and placement probabilities of dominoes.
منابع مشابه
A generalization of Aztec diamond theorem, part II
We consider a new family of 4-vertex regions with zigzag boundary on the square lattice with diagonals drawn in. By proving that the number of tilings of the new regions is given by a power 2, we generalize both Aztec diamond theorem and Douglas’ theorem. The proof extends an idea of Eu and Fu for Aztec diamonds, by using a bijection between domino tilings and non-intersecting Schröder paths, t...
متن کاملA Bijection Proving the Aztec Diamond Theorem by Combing Lattice Paths
We give a bijective proof of the Aztec diamond theorem, stating that there are 2n(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öder paths, with horizontal, diagonal or vertical steps, linking the grid points of two adjacent sides of an n× n square grid; these families are well known to be in bijec...
متن کاملA Simple Proof of the Aztec Diamond Theorem
Based on a bijection between domino tilings of an Aztec diamond and nonintersecting lattice paths, a simple proof of the Aztec diamond theorem is given by means of Hankel determinants of the large and small Schröder numbers.
متن کاملDomino Shuffling on Novak Half-Hexagons and Aztec Half-Diamonds
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, which turn out to be intimately related. This connection allows us to prove an “arctic parabola” theorem for the Half-Hexagons as a corollary of the Arctic ...
متن کاملA Reduction Theorem for Perfect Matchings of Graphs Having a Cellular Completion
A cellular graph is a graph whose edges can be partitioned into 4-cycles (called cells) so that each vertex is containedin at most two cells. We present a \ReductionTheorem" for the number of matchingsof certain subgraphs of cellular graphs. This generalizesthe main result of Ci1]. As applications of the Reduction Theorem we obtain a new proof of Stanley's multivariate version of the Aztec diam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998