DOCSLIB.ORG

Baxter Permutations, Snow Leopard Permutations, and Domino Tilings of Aztec Diamonds

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Baxter Permutations, Snow Leopard Permutations, and Domino Tilings of Aztec Diamonds Baxter Permutations, Snow Leopard Permutations, and Domino Tilings of Aztec Diamonds Ben Caffrey, Gregory Michel, Kailee Rubin, & Jonathan Ver Steegh∗ March 3, 2014 Abstract In [2], Elkies, Kuperberg, Larsen, and Propp introduce a bijection between domino tilings of Aztec diamonds and pairs of alternating sign matrices whose sizes differ by one. In this paper we first study those smaller permutations (viewed as matrices) which are paired with doubly alternating Baxter permutations. We call these permutations snow leopard permutations, and we use a recursive decomposition to show they are counted by the Catalan numbers. We also describe a specific set of transpositions which generates these permutations. Lastly, we investigate the general case, where we conjecture that the number of larger permutations paired with a given smaller permutation is a product of Fibonacci numbers. 1 Introduction and Background An alternating sign matrix (ASM) is an n × n matrix with entries in f0; 1; −1g whose nonzero entries in each row and column alternate in sign and sum to 1. An Aztec diamond of order n is a two dimensional array of unit squares with 2i squares in rows i ≤ n and 2(2n − i + 1) squares in rows n < i ≤ 2n; in which the squares are centered on each row. Figure1 shows the Aztec diamond of order 3. Figure 1: The Aztec diamond of order 3. Aztec diamonds can be tiled using 2×1 domino rectangles, which is to say they can be completely covered by disjoint dominoes whose union is the entire diamond. We abbreviate a tiling of an Aztec ∗Current address: c/o Eric Egge, Department of Mathematics, Carleton College, Northfield, MN 55057; Email: [email protected] 1 diamond as a TOAD. In [2], Elkies, Kuperberg, Larsen, and Propp describe how to construct, for each TOAD of order n, a pair of ASMs of size n × n and (n + 1) × (n + 1). We can describe this construction most easily with an example. In Figure2, the vertices that compose the tiled Aztec diamond fall naturally into two matrices: the red vertices form an (n + 1) × (n + 1) matrix while the blue vertices form an n × n matrix. The tops of these matrices align with the northeast edge of the diamond. To construct an ASM on the red vertices, label each vertex of degree 4 with a 1, each vertex with degree 3 with a 0, and each vertex with degree 2 with a −1. The n × n matrix on the blue vertices can be constructed in the same way except the degree 4 and degree 2 rules are reversed. Given a TOAD T , we write LASM(T ) to denote the larger of the ASMs and SASM(T ) to denote the smaller of the two ASMs. Following [2], we say an (n + 1) × (n + 1) ASM A and an n × n ASM B are compatible whenever there exists a proper tiling T such that A = LASM(T ) and B = SASM(T ). Figure 2: A domino tiling of the Aztec diamond of order 3 According to the rules defined above, the TOAD in Figure2 has 20 0 0 13 20 0 13 1 0 0 0 LASM(T ) = 6 7 ; SASM(T ) = 1 0 0 : 60 0 1 07 4 5 4 5 0 1 0 0 1 0 0 In one-line notation, these matrices refer to the permutations 4132 and 312, respectively. In [2], Elkies, Kuperberg, Larsen, and Propp show that an order n+1 ASM with k entries equal to −1 is compatible with 2k ASMs of size n. As a corollary, each permutation matrix, which is an ASM with no −1 entries, is compatible with exactly one smaller ASM. Canary [1] gives an algorithm to construct the unique smaller ASM compatible with any given permutation. To implement this algorithm, suppose π is a permutation of length n + 1. Label the red vertices in a diagram for an Aztec diamond of the appropriate size with the entries of the matrix for π. For each blue vertex, if the two red vertices immediately to the northwest, and all red vertices northwest of those, are labeled with 0, then label the blue vertex 0. Now repeat this process in each of the other three directions (northeast, southeast, and southwest). Canary shows that each row and column of blue vertices will now contain an odd number of unlabeled vertices; there is a unique way to label these vertices with 1s and −1s to create an ASM. 2 Canary proves that this smaller ASM will also be a permutation matrix if and only if the original permutation matrix is Baxter. A Baxter permutation is a permutation that avoids 2 − 41 − 3 and avoids 3 − 14 − 2, which means that, in one-line notation, it has no subsequence ai; aj; aj+1; ak such that aj+1 < ai < ak < aj (for 3 − 14 − 2) or aj < ak < ai < aj+1 (for 2 − 41 − 3). For example, 174962835 is not Baxter because the subsequence 4−62−5 is an instance of 2−41−3. In contrast, 879164325 is Baxter because it contains no instances of 2 − 41 − 3 or 3 − 14 − 2. An interesting class of Baxter permutations are the doubly alternating Baxter permutations. We call a permutation π = a1a2 ··· an alternating whenever ai < ai+1 if i is odd and ai > ai+1 if i is even. This is to say that π starts with an ascent and the ascents and descents alternate. A doubly alternating permutation is an alternating permutation whose inverse is also alternating. We call permutations that are both doubly alternating and Baxter doubly alternating Baxter permutations th (DABPs). Guibert and Linusson show in [3] that Cn, the n Catalan number, counts both the DABPs of length 2n and the DABPs of length 2n + 1. The Catalan numbers are ubiquitous in 1 2n combinatorics and have a number of definitions. The simplest of these is the formula Cn = n+1 n , but they can also be thought of as the number of Catalan paths, which are paths from (0; 0) to (n; n) along an n × n square grid using north and east steps and not crossing below the main diagonal. Pn The Catalan numbers also satisfy the recursive definition C0 = 1 and Cn+1 = j=1 Cj−1Cn−j for n ≥ 0. In this paper, we introduce snow leopard permutations (SLPs), which are the permutations whose matrices are compatible with doubly alternating Baxter permutation matrices. In Section 2, we characterize these permutations recursively, and by doing so, we show that the compatibility relation in this case is one-to-one, which implies that the snow leopard permutations of length 2n are also counted by Cn, as are the snow leopard permutations of length 2n + 1. Then, we give a bijection between snow leopard permutations and Catalan paths in Section 3, and in Section 4 we describe a construction of snow leopard permutations based on transpositions. Lastly, in Section 5 we show that the identity permutation of length n is compatible with Fn permutations of length th n + 1, where Fn denotes the n Fibonacci number. We conclude by conjecturing that the number of length n + 1 permutations with which a length n permutation is compatible is a product of Fibonacci numbers. 2 Snow Leopard Permutations: a Recursive Characterization In order to construct snow leopard permutations recursively, it is important to first understand how to construct DABPs and TOADs recursively. To understand this process, we first describe how to decompose DABPs and TOADs into smaller DABPs and TOADs, respectively. 2.1 Definitions and Notation Before we begin, we introduce some key definitions and specific notation for working with permu- tations in one-line notation. C Definition 2.1. The complement of a permutation π = a1 ··· an is π = n − a1 + 1 n − a2 + 1 ··· n − an + 1. Lemma 2.2. The complement of a Baxter permutation is Baxter. 3 Proof. Assume π is a Baxter permutation. Since the patterns 2 − 41 − 3 and 3 − 14 − 2 are complements of each other, πC will avoid 2 − 41 − 3 since π avoids 3 − 14 − 2 and vice versa. Definition 2.3. For any two sequences of positive integers, π1 = x1 ··· xi and π2 = y1 ··· yj, we write π1 ⊕ π2 to denote the concatenated sequence x1 ··· xiy1 ··· yj. Definition 2.4. Given a sequence of positive integers π = x1 ··· xi, and two indices m and n with 1 ≤ m ≤ n ≤ i, we define πm!n to be the subsequence of consecutive entries given by xmxm+1 ··· xn. Definition 2.5. Given a sequence of positive integers π and a constant b, we define AUGC(π; b) to be the sequence of positive integers created by taking the complement of π and then increasing the value of each entry by b. Example 2.6. Let π1 = 14325 and π2 = 768. We have π1 ⊕ π2 = 14325768, π12!4 = 432, and AUGC(π1; 5) = 10 7 8 9 6. 2.2 Doubly Alternating Baxter Permutation Decomposition In this subsection, we describe a decomposition algorithm that subdivides a single DABP into two smaller DABPs. In order to build to this algorithm, we must first prove several facts about the structure of DABPs. We begin a Lemma of Ouchterlony from [4]. Lemma 2.7. Suppose π is a DABP of length n. Then the following hold. 1. If n is odd then π(1) = 1. 2. If n is even and π(1) = 1 then π(n) = n. 3. If n is even, π(1) > 1, and k is the smallest integer for which π(k) < π(1), then i < k ≤ j implies π(i) < π(j).
Load more

Recommended publications
  • From Tiling Problems to Random Matrices
    From tiling problems to random matrices Tom Claeys Brussels Summer School of Mathematics September 4, 2018 Outline Tiling problems 1. Some fun to start with 2. Large random tilings Non-intersecting random walks and Brownian bridges 1. From hexagon tilings to non­intersecting paths 2. From non­intersecting paths to Brownian bridges Random matrices 1. From non­intersecting Brownian bridges to random matrix eigenvalues 2. Asymptotic properties of random matrix eigenvalues Tiling problems Given a two­dimensional domain and a collection of (shapes of) tiles, we try to cover the domain with the tiles. Tiling problems Rules ✓ Allowed: translations of tiles ✓ Forbidden: rotations, intersections, cutting tiles, crossing the border of the domain Questions ✓ Solvability? Can the domain be covered with tiles? ✓ What is the number of possible tilings? ✓ Do different tilings share certain properties? Tiling problems A possible tiling Tiling problems A possible tiling Tiling problems A possible tiling Tiling problems A possible tiling Tiling problems A possible tiling Tiling problems A possible tiling Tilings of a 2 × n rectangle We speak of a domino tiling if the tiles or 1 × 2 and 2 × 1 rectangles. First training example: tiling of a rectangle of height 2 Tilings of a 2 × n rectangle Number of tilings 1 2 3 5 8 13 Number of tilings of a 2 × n rectangle The Fibonacci sequence! Checkerboard tilings Second training example: tiling a square of size 8 × 8 Checkerboard tilings One tiling of the checkerboard Checkerboard tilings And another one ... Number of tilings of a checkerboard? ✓ 12 988 816 Tilings of the mutilated checkerboard Third training example: two boxes removed Number of tilings of the mutilated checkerboard? Tilings of the mutilated checkerboard Third training example: two boxes removed Number of tilings of the mutilated checkerboard? ✓ None ! Tilings of the mutilated checkerboard Third training example: two boxes removed Theorem (GOMORY 1973) If we remove a white and a black box from the checkerboard, there exists always a tiling.
    [Show full text]
  • Asymptotics of Multivariate Sequences, Part III: Quadratic Points
    Asymptotics of multivariate sequences, part III: quadratic points Yuliy Baryshnikov 1 Robin Pemantle 2,3 ABSTRACT: We consider a number of combinatorial problems in which rational generating func- tions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist points near which one of the factors is asymptotic to a nondegenerate quadratic. We compute the asymptotics of the coefficients of such a generating function. The computation requires some topological deformations as well as Fourier-Laplace transforms of generalized functions. We apply the results of the theory to specific combinatorial problems, such as Aztec diamond tilings, cube groves, and multi-set permutations. Keywords: generalized function, Fourier transform, Fourier-Laplace, lacuna, multivariate generating function, hyperbolic polynomial, amoeba, Aztec diamond, quantum random walk, random tiling, cube grove. Subject classification: Primary: 05A16 ; Secondary: 83B20, 35L99. 1Bell Laboratories, Lucent Technologies, 700 Mountain Avenue, Murray Hill, NJ 07974-0636, [email protected] labs.com 2Research supported in part by National Science Foundation grant # DMS 0603821 3University of Pennsylvania, Department of Mathematics, 209 S. 33rd Street, Philadelphia, PA 19104 USA, pe- [email protected] Contents 1 Introduction 1 1.1 Background and motivation . 1 1.2 Methods and organization . 4 1.3 Comparison with other techniques . 7 2 Notation and preliminaries 8 2.1 The Log map and amoebas . 9 2.2 Dual cones, tangent cones and normal cones . 10 2.3 Hyperbolicity for homogeneous polynomials . 11 2.4 Hyperbolicity and semi-continuity for log-Laurent polynomials on the amoeba boundary 14 2.5 Critical points . 20 2.6 Quadratic forms and their duals .
    [Show full text]
  • Aztec Diamond Theorem by Combing Lattice Paths
    A BIJECTION PROVING THE AZTEC DIAMOND THEOREM BY COMBING LATTICE PATHS FRÉDÉRIC BOSIO AND MARC VAN LEEUWEN Abstract. 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 bijection with tilings of the Aztec diamond. Our bijection is produced by an invertible “combing” algorithm, operating on families of paths without non-intersection condition, but instead with the requirement that any vertical steps come at the end of a path, and which are clearly 2n(n+1)/2 in number; it transforms them into non-intersecting families. 1. Introduction The term “Aztec diamond”, introduced by Elkies, Kuperberg, Larsen and Propp [EKLP92], refers to a diamond-shaped set of squares in the plane, ob- tained by taking a triangular array of squares aligned against two perpendicular axes, and completing it with its mirror images in those two axes; the order of the diamond is the number of squares along each of the sides of the triangular array. Their main result concerns counting the number of domino tilings (i.e., partitions into subsets of two adjacent squares) of the Aztec diamond. n+1 Theorem 1 (Aztec diamond theorem). There are exactly 2( 2 ) domino tilings of the Aztec diamond of order n.
    [Show full text]
  • Aztec Diamonds and Digraphs, and Hankel Determinants of Schröder
    Aztec Diamonds and Digraphs, and Hankel Determinants of Schr¨oder Numbers Richard A. Brualdi Stephen Kirkland Department of Mathematics Department of Mathematics University of Wisconsin University of Regina Madison, WI 53706 Regina, Sask., Canada S4S 082 [email protected] [email protected] June 2, 2003 Abstract The Aztec diamond of order n is a certain configuration of 2n(n + 1) unit squares. We give a new proof of the fact that the number Πn of tilings of the Aztec diamond of order n with dominoes equals 2n(n+1)/2. We determine a sign-nonsingular matrix of order n(n + 1) whose determinant gives Πn. We reduce the calculation of this determinant to that of a Hankel matrix of order n whose entries are large Schr¨oder numbers. To calculate that determinant we make use of the J-fraction expansion of the generating function of the Schr¨oder numbers. 1 Introduction Let n be a positive integer. The Aztec diamond of order n is the union ADn of all the unit squares with integral vertices (x, y) satisfying x + y n+1. The Aztec diamond of order | | | | ≤ 1 consists of the 4 unit squares which have the origin (0, 0) as one of their vertices. The Aztec diamonds of orders 2 and 4 are shown in Figure 1. Aztec diamonds are invariant under rotation by 90 degrees, and by reflections in the horizontal and vertical axes. The part of the Aztec diamond of order n that lies in the positive quadrant consists of a staircase pattern of n, n 1,..., 1 unit squares.
    [Show full text]
  • A Simple Proof of the Aztec Diamond Theorem
    A Simple Proof of the Aztec Diamond Theorem Sen-Peng Eu1,∗ and Tung-Shan Fu2,† 1Department of Applied Mathematics, National University of Kaohsiung, Kaohsiung 811, Taiwan [email protected] 2Mathematics Faculty, National Pingtung Institute of Commerce, Pingtung 900, Taiwan [email protected] Abstract Based on a bijection between domino tilings of an Aztec diamond and non- intersecting lattice paths, a simple proof of the Aztec diamond theorem is given in terms of Hankel determinants of the large and small Schr¨oder numbers. MSC2000: 05A15 Keywords: Aztec diamond, Hankel matrix, Schr¨oder numbers, lattice paths 1 Introduction The Aztec diamond of order n, denoted by Az(n), is defined as the union of all the unit squares with integral corners (x, y) satisfying |x| + |y| ≤ n +1. A domino is simply a 1-by-2 or 2-by-1 rectangles with integral corners. A domino tiling of a region R is a set of non-overlapping dominos the union of which is R. Figure 1 shows the Aztec diamond of order 3 and a domino tiling. The Aztec diamond theorem, which is first proved by Elkies arXiv:math/0412041v1 [math.CO] 2 Dec 2004 et al. in [4], indicates that the number an of domino tilings of the Aztec diamond of order n is 2n(n+1)/2. They gave four proofs by relating the tilings to alternating sign matrices, monotone triangles, representations of general linear groups, and domino shuffling. Other approaches to this theorem appeared in [2, 3, 6]. Ciucu [3] derived the recurrence relation n an = 2 an−1 by means of perfect matchings of celluar graphs.
    [Show full text]
  • Airy Point Process at the Liquid-Gas Boundary Vincent Beffara, Sunil Chhita, Kurt Johansson
    Airy point process at the liquid-gas boundary Vincent Beffara, Sunil Chhita, Kurt Johansson To cite this version: Vincent Beffara, Sunil Chhita, Kurt Johansson. Airy point process at the liquid-gas boundary. Annals of Probability, Institute of Mathematical Statistics, 2018, 46 (5), pp.2973 - 3013. 10.1214/17-aop1244. hal-01632943v2 HAL Id: hal-01632943 https://hal.archives-ouvertes.fr/hal-01632943v2 Submitted on 19 Sep 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The Annals of Probability 2018, Vol. 46, No. 5, 2973–3013 https://doi.org/10.1214/17-AOP1244 © Institute of Mathematical Statistics, 2018 AIRY POINT PROCESS AT THE LIQUID-GAS BOUNDARY BY VINCENT BEFFARA1,SUNIL CHHITA1 AND KURT JOHANSSON2 Université Grenoble Alpes, Durham University and Royal Institute of Technology KTH Domino tilings of the two-periodic Aztec diamond feature all of the three possible types of phases of random tiling models. These phases are determined by the decay of correlations between dominoes and are generally known as solid, liquid and gas. The liquid-solid boundary is easy to define microscopically and is known in many models to be described by the Airy process in the limit of a large random tiling.
    [Show full text]
  • Arxiv:1906.07231V3 [Math.PR] 30 Oct 2020 Ical Exponents Are Expected to Depend Not So Much on the Intensity of the Non-Linearity, but Rather on Its Structure
    THE DOMINO SHUFFLING ALGORITHM AND ANISOTROPIC KPZ STOCHASTIC GROWTH SUNIL CHHITA AND FABIO LUCIO TONINELLI Abstract. The domino-shuffling algorithm [13,30] can be seen as a sto- chastic process describing the irreversible growth of a (2+1)-dimensional discrete interface [8,36]. Its stationary speed of growth vw(ρ) depends on the average interface slope ρ, as well as on the edge weights w, that are assumed to be periodic in space. We show that this growth model belongs 2 to the Anisotropic KPZ class [33, 35]: one has det[D vw(ρ)] < 0 and the height fluctuations grow at most logarithmically in time. Moreover, we prove that Dvw(ρ) is discontinuous at each of the (finitely many) smooth (or \gaseous") slopes ρ; at these slopes, fluctuations do not diverge as time grows. For a special case of spatially 2 periodic weights, analogous − results have been recently proven [8] via an explicit computation of vw(ρ). In the general case, such a computation is out of reach; instead, our proof goes through a relation between the speed of growth and the limit shape of domino tilings of the Aztec diamond. 1. Introduction In the realm of stochastic interface growth [2], dimension (2 + 1) (i.e., growth of a two-dimensional interface in three-dimensional physical space) plays a distinguished role. In (1+1) dimensions, one finds a non-trivial KPZ growth exponent β = 1=3 as soon as the growth process is genuinely non- linear, while in dimension (d + 1); d 3 a phase transition is expected [18] between a regime of small non-linearity,≥ where the process behaves quali- tatively like the stochastic heat equation (SHE) with additive noise, and a regime of large non-linearity, characterized by new growth and roughness critical exponents.
    [Show full text]
  • Asymptotic Domino Statistics in the Aztec Diamond
    The Annals of Applied Probability 2015, Vol. 25, No. 3, 1232–1278 DOI: 10.1214/14-AAP1021 c Institute of Mathematical Statistics, 2015 ASYMPTOTIC DOMINO STATISTICS IN THE AZTEC DIAMOND By Sunil Chhita1, Kurt Johansson1,2 and Benjamin Young1 University of Bonn, Royal Institute of Technology (KTH) and University of Oregon We study random domino tilings of the Aztec diamond with dif- ferent weights for horizontal and vertical dominoes. A domino tiling of an Aztec diamond can also be described by a particle system which is a determinantal process. We give a relation between the correla- tion kernel for this process and the inverse Kasteleyn matrix of the Aztec diamond. This gives a formula for the inverse Kasteleyn matrix which generalizes a result of Helfgott. As an application, we investi- gate the asymptotics of the process formed by the southern dominoes close to the frozen boundary. We find that at the northern boundary, the southern domino process converges to a thinned Airy point pro- cess. At the southern boundary, the process of holes of the southern domino process converges to a multiple point process that we call the thickened Airy point process. We also study the convergence of the domino process in the unfrozen region to the limiting Gibbs measure. 1. Introduction. The Aztec Diamond of order n is a planar region which can be completely tiled with dominoes, two-by-one rectangles. Over the past twenty years, this particular shape has come to occupy a central place in the literature of domino tilings of plane regions. Tilings of large Aztec diamonds exhibit striking features—the main one being that these tilings exhibit a limit shape, described by the so-called Arctic circle theorem [20].
    [Show full text]
  • [Math.CO] 21 Jun 1999
    Domino tilings with barriers In memory of Gian-Carlo Rota James Propp1 and Richard Stanley2 1University of Wisconsin, Madison, WI 53706 2Massachusetts Institute of Technology, Cambridge, MA 02139 In this paper, we continue the study of domino-tilings of Aztec diamonds (introduced in [1] and [2]). In particular, we look at certain ways of placing “barriers” in the Aztec diamond, with the constraint that no domino may cross a barrier. Remarkably, the number of constrained tilings is independent of the placement of the barriers. We do not know of a simple combinatorial explanation of this fact; our proof uses the Jacobi-Trudi identity. (NOTE: This article has been published in the Jour- on its bottom and right edges (a “zig”), barriers on its left and nal of Combinatorial Theory, Series A, the only definitive top edges (a “zag”), or no barriers at all (“zip”). Thus Figure repository of the content that has been certified and ac- 1 corresponds to the sequence of decisions “zip, zig, zip, zag, cepted after peer review. Copyright and all rights therein zip, zag, zip, zig.” Notice that in this example, for all i, the are retained by Academic Press. You can also access ith square has a zig or a zag if i is even and zip if i is odd. this article via IDEAL (the International Digital Electronic Henceforth (and in particular in the statement of the follow- Access Library) at ing Theorem) we assume that the placement of the barriers has this special form. http://www.idealibrary.com Theorem 1: Given a placement of barriers in the Aztec dia- or mond as described above, the number of domino-tilings com- patible with this placement is n(n+1)/2 k.
    [Show full text]
  • Aztec Diamonds and Digraphs, and Hankel Determinants of Schröder Numbers Richard A
    Journal of Combinatorial Theory, Series B 94 (2005) 334–351 www.elsevier.com/locate/jctb Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers Richard A. Brualdia, Stephen Kirklandb aDepartment of Mathematics, University of Wisconsin, Madison, 480 Lincoln Drive, Madison, WI 53706, USA bDepartment of Mathematics, University of Regina, Regina, Sask., Canada S45 0A2 Received 3 July 2003 Available online 12 March 2005 Abstract The Aztec diamond of order n is a certain configuration of 2n(n + 1) unit squares. We give a new proof of the fact that the number n of tilings of the Aztec diamond of order n with dominoes equals n(n+ )/ 2 1 2. We determine a sign-nonsingular matrix of order n(n + 1) whose determinant gives n. We reduce the calculation of this determinant to that of a Hankel matrix of order n whose entries are large Schröder numbers. To calculate that determinant we make use of the J-fraction expansion of the generating function of the Schröder numbers. © 2005 Elsevier Inc. All rights reserved. MSC: 05A15; 05B45; 05C50; 05C20 Keywords: Aztec diamond; Tiling; Digraph; Hankel determinant; Schröder numbers; Sign-nonsingular matrix 1. Introduction Let n be a positive integer. The Aztec diamond of order n is the union ADn of all the unit squares with integral vertices (x, y) satisfying |x|+|y|n+1. The Aztec diamond of order 1 consists of the 4 unit squares which have the origin (0, 0) as one of their vertices. TheAztec diamonds of orders 2 and 4 are shown in Figs. 1 and 2, respectively.
    [Show full text]
  • Aztec Diamonds, Checkerboard Graphs, and Spanning Trees
    P1: KCU/JVE P2: SRM/RSA Journal of Algebraic Combinatorics KL434-04-Knuth-I April 24, 1997 13:13 Journal of Algebraic Combinatorics 6 (1997), 253–257 c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. Aztec Diamonds, Checkerboard Graphs, and Spanning Trees DONALD E. KNUTH Department of Computer Science, Stanford University, Stanford, CA 94305-9045 Received October 25, 1994; Revised January 23, 1995 Abstract. This note derives the characteristic polynomial of a graph that represents nonjump moves in a gener- alized game of checkers. The number of spanning trees is also determined. Keywords: Aztec diamond, spanning tree, graph spectra, enumeration Consider the graph on mn vertices (x, y) 1 x m,1 y n , with (x, y) adjacent to (x , y ) if and only if x x {y y | 1. This graph consists } of disjoint subgraphs 0 0 | 0|=| 0|= ECm,n (x,y) x yis even , ={ | + } OCm,n (x,y) x yis odd , ={ | + } having respectively mn/2 and mn/2 vertices. When mn is even, ECm,n and OCm,n are d e b c isomorphic. The special case OC2n 1,2n 1 has been called an Aztec diamond of order n by + + n(n 1)/2 Elkies et al. [6], who gave several interesting proofs that it contains exactly 2 + perfect matchings. Richard Stanley recently conjectured [11] that OC2n 1,2n 1 contains exactly + + 4 times as many spanning trees as EC2n 1,2n 1, and it was his conjecture that motivated the present note. We will see that Stanley’s conjecture+ + follows from some even more remarkable properties of these graphs.
    [Show full text]
  • A Variational Principle for Domino Tilings
    JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 14, Number 2, Pages 297{346 S 0894-0347(00)00355-6 Article electronically published on November 3, 2000 A VARIATIONAL PRINCIPLE FOR DOMINO TILINGS HENRY COHN, RICHARD KENYON, AND JAMES PROPP Dedicated to Pieter Willem Kasteleyn (1924{1996) The effect of boundary conditions is, however, not entirely trivial and will be discussed in more detail in a subsequent paper. P. W. Kasteleyn, 1961 1. Introduction 1.1. Description of results. A domino is a 1 × 2(or2× 1) rectangle, and a tiling of a region by dominos is a way of covering that region with dominos so that there are no gaps or overlaps. In 1961, Kasteleyn [Ka1] found a formula for the number of domino tilings of an m × n rectangle (with mn even), as shown in Figure 1 for m = n = 68. Temperley and Fisher [TF] used a different method and arrived at the same result at almost exactly the same time. Both lines of calculation showed that the logarithm of number of tilings, divided by the number of dominos in a tiling (that is, mn=2), converges to 2G=π ≈ 0:58 (here G is Catalan's constant). On the other hand, in 1992 Elkies et al. [EKLP] studied domino tilings of regions they called Aztec diamonds (Figure 2 shows an Aztec diamond of order 48), and showed that the logarithm of the number of tilings, divided by the number of dominos, converges to the smaller number (log 2)=2 ≈ 0:35. Thus, even though the region in Figure 1 has slightly smaller area than the region in Figure 2, the former has far more domino tilings.
    [Show full text]