Proof of a generalization of Aztec diamond theorem
|
|
- Anastasia Harper
- 5 years ago
- Views:
Transcription
1 Proof of a generalization of Aztec diamond theorem Institute for Mathematics and its Applications University of Minnesota Minneapolis, MN December 5, 2014
2 Aztec Diamond Theorem Definition The Aztec diamond of order n is the collection of unit squares inside the contour x + y = n + 1. Theorem (Elkies, Kuperberg, Larsen and Propp 1991) There are 2 n(n+1)/2 ways to cover the Aztec diamond of order n by dominoes so that there are no gaps or overlaps.
3 Aztec Diamond Theorem Theorem (Elkies Kuperberg Larsen Propp, 1991) There are 2 n(n+1)/2 ways to cover the Aztec diamond of order n by dominoes so that there are no gaps or overlaps. The first four proofs have been given by Elkies, Kuperberg, Larsen and Propp. Many further proofs: Propp 2003 Kuo 2004 Brualdi and Kirkland 2005 Eu and Fu 2005 Bosio and Leeuwen 2013 Fendler and Grieser 2014
4 Terminology Introduction A lattice divides the plane into fundamental regions called cells.
5 Terminology Introduction A lattice divides the plane into fundamental regions called cells. A tile is a union of any two cells sharing an edge.
6 Terminology Introduction A lattice divides the plane into fundamental regions called cells. A tile is a union of any two cells sharing an edge. A tiling of a region is a covering of the region by tiles so that there are no gaps or overlaps.
7 Terminology Introduction A lattice divides the plane into fundamental regions called cells. A tile is a union of any two cells sharing an edge. A tiling of a region is a covering of the region by tiles so that there are no gaps or overlaps. Denote by M(R) the number of tilings of R.
8 Hybrid Domino-Lozenge Tilings and Douglas Theorem n=2 n=4 n=6 Theorem The number of tilings of the region of order 2k is 2 2k(k+1).
9 Hybrid Domino-Lozenge Tilings and Douglas Theorem Are there similar regions on the square lattice with arbitrary diagonals drawn in?
10 Hybrid Domino-Lozenge Tilings and Douglas Theorem Are there similar regions on the square lattice with arbitrary diagonals drawn in? What is the number of tilings of the region?
11 Hybrid Domino-Lozenge Tilings and Douglas Theorem Are there similar regions on the square lattice with arbitrary diagonals drawn in? What is the number of tilings of the region? Is it still a power of 2?
12 Generalized Douglas region D a (d 1, d 2,..., d k ). A l a l D B d1 d2 d3 d4 C Figure : The region D 7 (4, 2, 5, 4). The width is the numbers of squares running from B to C.
13 Generalization of Aztec diamond theorem Theorem (L, 2014) Assume that D a (d 1,..., d k ) has the width w. Assume that the the vertices B and D are on the same level. Then M(D a (d 1,..., d k )) = 2 C w(w+1)/2 (1) where C is the number of black squares and black up-pointing triangles (which we called regular cells).
14 Example Introduction A l a l D B d1 d2 d3 d4 C The region D 7 (4, 2, 5, 4) has the width w = 8 and C = = 65. Therefore M(D 7 (4, 2, 5, 4)) = 2 C w(w+1)/ = 2 2 = 536, 870, 912.
15 Remark Introduction Q: Why did we assume that B and D are on the same level in the main theorem?
16 Remark Introduction Q: Why did we assume that B and D are on the same level in the main theorem? A: Otherwise the numbers black and white cells are not the same, so the region has no tiling.
17 A remark Introduction A A balanced balanced D B D B balanced C balanced C
18 A remark Introduction A D B C
19 Bijection between tilings and perfect matchings Figure : Bijection between tilings of the Aztec diamond of order 5 and perfect matchings of its dual graph. The dual graph of a region R is the graph whose vertices are the cells in R and whose edges connect precisely two adjacent cells. A perfect matching of a graph G is a collection of disjoint edges covering all vertices of G.
20 From tilings to families of non-intersecting paths A l l D B d1 d2 d3 d4 C
21 From tilings to families of non-intersecting paths G G
22 From tilings to families of non-intersecting paths G G
23 From tilings to families of non-intersecting paths G
24 From tilings to families of non-intersecting paths
25 From tilings to families of non-intersecting paths x
26 From tilings to families of non-intersecting paths x
27 Schröder paths Definition A Schröder path is a lattice path: 1 starting and ending on the x-axis; 2 never go below x-axis; 3 using the steps: (1,1) up, (1,-1) down, and (2,0) flat x
28 Large and small Schröder numbers gessel/homepage/slides/schroder.pdf r n = the number of Schröder paths from (0, 0) to (2n, 0).
29 Large and small Schröder numbers gessel/homepage/slides/schroder.pdf r n = the number of Schröder paths from (0, 0) to (2n, 0). s n = the number of Schröder paths from (0, 0) to (2n, 0) with no flat step on the x-axis.
30 Large and small Schröder numbers gessel/homepage/slides/schroder.pdf r n = the number of Schröder paths from (0, 0) to (2n, 0). s n = the number of Schröder paths from (0, 0) to (2n, 0) with no flat step on the x-axis. r n = 2s n
31 Large and small Schröder numbers gessel/homepage/slides/schroder.pdf r n = the number of Schröder paths from (0, 0) to (2n, 0). s n = the number of Schröder paths from (0, 0) to (2n, 0) with no flat step on the x-axis. r n = 2s n R(x) = n=0 r nx n = 1 x 1 6x + x 2 2x
32 Schröder paths with barriers Definition 1 For integers a m > a m 1 >... > a 1 0, define B(a 1, a 2,..., a m ) is the set of length-1 barriers running along the lines y = x + a i (i.e. connecting ( a i + k, k ) and ( a i + k + 1, k )). 2 If a Schröder path P avoids all barriers in B = B(a 1, a 2,..., a m ), we say P is compatible with B
33 Two families of non-intersecting Schröder paths with barriers Definition 1 Let x i be the i-th largest negative odd number in Z\{ a 1,..., a m }. 2 Π n (a 1,..., a m ) set of n-tuples of non-intersecting Schröder paths (π 1,..., π n ), where π i connects A i = (x i, 0) and B i = (2i 1, 0) and is compatible with B(a 1, a 2,..., a m ).
34 Families of non-intersecting paths in D a (d 1, d 2,..., d k ) x Figure : Families of non-intersecting paths in D 7 (4, 2, 5, 4). Π w (a 1,..., a k 1 ) where a i := d k d k i+1 + i 1, for i = 1, 2,..., k 1.
35 Families of non-intersecting paths in D a (d 1, d 2,..., d k ) x Lemma M(D a (d 1,..., d k )) = Π w (a 1,..., a k 1 ), (2) where a i := d k d k i+1 + i 1, for i = 1, 2,..., k 1.
36 Inductive proof on the number layers Theorem M(D a (d 1, d 2,..., d k )) = 2 C w(w+1)/2 (*) If k = 1, the theorem follows from the Aztec diamond theorem. Assume that (*) is true for any generalized Douglas regions with less than k layers (k 2). We need to show for any D a (d 1, d 2,..., d k ). Consider the d k = 2x (the case d k = 2x 1 can be obtained similarly).
37 Reduction using Lindström Gessel Viennot Lemma. Lemma (Linström Gessel Viennot) 1 G is an acyclic digraph. 2 U = {u 1, u 2,..., u n }, V = {v 1, v 2,..., v n } 3 For any 1 i < j n, P : u i v j intersects Q : u j v i. Then a 1,1 a 1,2... a 1,n a 2,1 a 2,2... a 2,n #(τ 1, τ 2,..., τ n ) U V = det..., a n,1 a n,2... a n,n where a i,j is the number of paths from u i to v j.
38 Reduction using Linström Gessel Viennot Lemma. M(D a (d 1,..., d k )) = Π w (a 1,..., a m ) = det(h w (a 1,..., a m )), (3) where r 1,1 r 1,2... r 1,w r 2,1 r 2,2... r 2,w H w := H w (a 1,..., a m ) :=..., (4) r w,1 r w,2... r w,w and where r i,j = the number of Schröder paths connecting A i to B j compatible with B(a 1,..., a m ).
39 Reduction using Linström Gessel Viennot Lemma. A4 A 3 A 2 A 1 B 1 B B B 2 3 4
40 Reduction using Linström Gessel Viennot Lemma. Definition Given B(a 1,..., a m ) 1 A bad level step is a level step on x-axis avoiding all points ( a i, 0). 2 Λ n (a 1,..., a m ) set of n-tuples of non-intersecting Schröder paths (λ 1,..., λ n ), where λ i connects A i = (x i, 0) and B i = (2i 1, 0), is compatible with B(a 1, a 2,..., a m ), and has no bad flat step.
41 Reduction using Linström Gessel Viennot Lemma. Λ w (a 1,..., a m ) = det(q w (a 1,..., a m )), (5) where s 1,1 s 1,2... s 1,w s 2,1 s 2,2... s 2,w Q w := Q w (a 1,..., a m ) :=..., (6) s w,1 s w,2... s w,w and where s i,j = the number of Schröder paths connecting A i to B j, is compatible with B(a 1,..., a m ), and has no bad flat step.
42 Reduction using Linström Gessel Viennot Lemma. A4 A 3 A 2 A 1 B 1 B B B 2 3 4
43 Reduction using Linström Gessel Viennot Lemma. Lemma If a 1 > 1, then r i,j = 2s i,j. det(h w (a 1,..., a m )) = 2 w det(q w (a 1,..., a m ))
44 Reduction using Linström Gessel Viennot Lemma. Lemma If a 1 > 1, then r i,j = 2s i,j. det(h w (a 1,..., a m )) = 2 w det(q w (a 1,..., a m )) Π w (a 1,..., a m ) = 2 w Λ w (a 1,..., a m )
45 Reduction using Linström Gessel Viennot Lemma. Π w (a 1,..., a m ) = 2 w Λ w (a 1,..., a m ) Lemma If a 1 > 1, then Π w 1 (a 1 2,..., a m 2) = Λ w (a 1,..., a m )
46 Reduction using Linström Gessel Viennot Lemma. Π w (a 1,..., a m ) = 2 w Π w 1 (a 1 2,..., a m 2)
47 Reduction using Linström Gessel Viennot Lemma. Π w (a 1,..., a m ) = 2 w Π w 1 (a 1 2,..., a m 2) = 2 x 1 i=0 (w i) Π w x (0, a 2 a 1,..., a m a 1 )
48 Comparing a and x A D B x x+1 C a x w x + 1
49 Case a = x Introduction A D B C
50 Case a = x Introduction A D B C We have d 1 = d 2 =... = d k 1 = 1 and w = k + x 1 so Π w x (0, a 2 a 1..., a m a 1 ) = Π k 1 (0, 2, 4,..., 2(k 1)) = 1.
51 Case a = x Introduction Π k 1 (0, 2, 4,..., 2(k 1)) =
52 Case a = x Introduction M(D a (d 1,..., d k )) = Π w (a 1,..., a m ) = 2 x 1 i=0 (w i). Need to show that x 1 (w i) = C w(w + 1)/2 i=0
53 Case a = x Introduction Need to show that x 1 (w i) = C w(w + 1)/2 i=0 A D B C w x 1 C = (w + 1)x + (w i) i=0
54 Case a > x Introduction M(D a (d 1,..., d k )) = 2 x 1 i=0 (w i) Π w x (0, a 2 a 1,..., a m a 1 ) Lemma Π w x (0, a 2 a 1,..., a m a 1 ) = Π w x 1 (a 2 a 1 2,..., a m a 1 2)
55 Case a > x Introduction M(D a (d 1,..., d k )) = 2 x 1 i=0 (w i) Π w x 1 (a 2 a 1 2,..., a m a 1 2) Recall that we have bijection between tilings of D a (d 1,..., d k ) and elements of Π w (a 1, a 2,..., a m ).
56 Case a > x Introduction M(D a (d 1,..., d k )) = 2 x 1 i=0 (w i) Π w x 1 (a 2 a 1 2,..., a m a 1 2) Recall that we have bijection between tilings of D a (d 1,..., d k ) and elements of Π w (a 1, a 2,..., a m ). Tilings of D := D a x (d 1, d 2,..., d k 1 1) correspond to elements of Π w x 1 (a 2 a 1 2,..., a m a 1 2).
57 Case a > x Introduction M(D a (d 1,..., d k )) = 2 x 1 i=0 (w i) Π w x 1 (a 2 a 1 2,..., a m a 1 2) Recall that we have bijection between tilings of D a (d 1,..., d k ) and elements of Π w (a 1, a 2,..., a m ). Tilings of D := D a x (d 1, d 2,..., d k 1 1) correspond to elements of Π w x 1 (a 2 a 1 2,..., a m a 1 2). M(D a (d 1,..., d k )) = 2 x 1 i=0 (w i) M(D a x (d 1, d 2,..., d k 1 1))
58 Case a > x Introduction M(D a (d 1,..., d k )) = 2 x 1 i=0 (w i) M(D a x (d 1, d 2,..., d k 1 1))
59 Case a > x Introduction M(D a (d 1,..., d k )) = 2 x 1 i=0 (w i) 2 C w (w +1)/2
60 Case a > x Introduction M(D a (d 1,..., d k )) = 2 x 1 i=0 (w i) 2 C w (w +1)/2 w w = x + 1
61 Case a > x Introduction M(D a (d 1,..., d k )) = 2 x 1 i=0 (w i) 2 C w (w +1)/2 w w = x + 1 C C = (w + 1)x + w + x(w x 1)
62 Case a > x Introduction M(D a (d 1,..., d k )) = 2 C w(w+1)/2
63 Questions? Introduction Thank you!
Enumeration of domino tilings of a double Aztec rectangle
Enumeration of domino tilings of a double Aztec rectangle University of Nebraska Lincoln Lincoln, NE 68505 AMS Fall Central Sectional Meeting University of St. Thomas Minneapolis, MN, October 30, 2015
More informationA Simple Proof of the Aztec Diamond Theorem
A Simple Proof of the Aztec Diamond Theorem Sen-Peng Eu Department of Applied Mathematics National University of Kaohsiung Kaohsiung 811, Taiwan, ROC speu@nuk.edu.tw Tung-Shan Fu Mathematics Faculty National
More informationTiling expression of minors
Institute for Mathematics and its Applications Minneapolis, MN Colloquium University of British Columbia, Vancourver February, 0 Outline Introduction to the Enumeration of Tilings. Electrical networks
More informationMONOMER CORRELATIONS ON THE SQUARE LATTICE. Mihai Ciucu Indiana University Department of Mathematics, Bloomington, IN 47405, USA
MONOMER CORRELATIONS ON THE SQUARE LATTICE Mihai Ciucu Indiana University Department of Mathematics, Bloomington, IN 4745, USA Domino tilings Domino tilings are equivalent to perfect matchings. M(G) :=
More informationENUMERATION OF DOMINO TILINGS OF AN AZTEC RECTANGLE WITH BOUNDARY DEFECTS
ENUMERATION OF DOMINO TILINGS OF AN AZTEC RECTANGLE WITH BOUNDARY DEFECTS MANJIL P. SAIKIA Abstract. In this paper we enumerate domino tilings of an Aztec rectangle with arbitrary defects of size one on
More informationTHE Q-SPECTRUM AND SPANNING TREES OF TENSOR PRODUCTS OF BIPARTITE GRAPHS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3155 3161 S 0002-9939(9704049-5 THE Q-SPECTRUM AND SPANNING TREES OF TENSOR PRODUCTS OF BIPARTITE GRAPHS TIMOTHY
More informationDomino tilings with barriers. In memory of Gian-Carlo Rota
Domino tilings with barriers In memory of Gian-Carlo Rota James Propp Richard Stanley University of Wisconsin, Madison, WI 53706 Massachusetts Institute of Technology, Cambridge, MA 02139 In this paper,
More informationTwo-periodic Aztec diamond
Two-periodic Aztec diamond Arno Kuijlaars (KU Leuven) joint work with Maurice Duits (KTH Stockholm) Optimal and Random Point Configurations ICERM, Providence, RI, U.S.A., 27 February 2018 Outline 1. Aztec
More informationCluster Variables and Perfect Matchings of Subgraphs of the dp 3 Lattice
Cluster Variables and Perfect Matchings of Subgraphs of the dp Lattice Sicong Zhang October 8, 0 Abstract We give a combinatorial intepretation of cluster variables of a specific cluster algebra under
More informationCombinatorial proofs of addition formulas
Combinatorial proofs of addition formulas Xiang-Ke Chang Xing-Biao Hu LSEC, ICMSEC, Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing, China Hongchuan Lei College of Science
More informationA factorisation theorem for the number of rhombus tilings of a hexagon with triangular holes
for the number of rhombus tilings of a hexagon with triangular holes Indiana University; Universität Wien Prelude Rhombus tilings Prelude Rhombus tilings Prelude Rhombus tilings Dimer configurations Prelude
More informationSTABLE CLUSTER VARIABLES
STABLE CLUSTER VARIABLES GRACE ZHANG Abstract. Eager and Franco introduced a transformation on the F-polynomials of Fomin and Zelevinsky that seems to display a surprising stabilization property in the
More informationRHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS
RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS THERESIA EISENKÖLBL Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. E-mail: Theresia.Eisenkoelbl@univie.ac.at
More informationarxiv: v1 [math.co] 30 May 2016
ENUMERATION OF DOMINO TILINGS OF AN AZTEC RECTANGLE WITH BOUNDARY DEFECTS MANJIL P. SAIKIA Abstract. Helfgott and Gessel gave the number of domino tilings of an Atec Rectangle ith defects of sie one on
More informationDOMINO TILING. Contents 1. Introduction 1 2. Rectangular Grids 2 Acknowledgments 10 References 10
DOMINO TILING KASPER BORYS Abstract In this paper we explore the problem of domino tiling: tessellating a region with x2 rectangular dominoes First we address the question of existence for domino tilings
More informationArithmetic properties of the adjacency matrix of quadriculated disks
Arithmetic properties of the adjacency matrix of quadriculated disks arxiv:math/00762v2 [mathco] 3 Aug 2003 Nicolau C Saldanha and Carlos Tomei December 22, 203 Abstract Let be a bicolored quadriculated
More informationCATALAN DETERMINANTS A COMBINATORIAL APPROACH
CATALAN DETERMINANTS A COMBINATORIAL APPROACH ARTHUR T BENJAMIN, NAIOMI T CAMERON, JENNIFER J QUINN, AND CARL R YERGER Abstract Determinants of matrices involving the Catalan sequence have appeared throughout
More informationA TRIANGULAR GAP OF SIZE TWO IN A SEA OF DIMERS ON A 60 ANGLE. Bloomington, IN 47401, USA Nordbergstraße 15 A-1090 Wien, Austria. 1.
A TRIANGULAR GAP OF SIZE TWO IN A SEA OF DIMERS ON A 60 ANGLE Mihai Ciucu 1 Ilse Fischer 2 Indiana University Universität Wien Department of Mathematics Fakultät für Mathematik Bloomington, IN 47401, USA
More informationTwenty Open Problems in Enumeration of Matchings
arxiv:math/9801060v3 [math.co] 27 Apr 1999 Twenty Open Problems in Enumeration of Matchings James Propp Mathematical Sciences Research Institute December 9, 1996 (last revised: September 2, 1998) This
More informationDomino tilings, non-intersecting Random Motions and Critical Processes
Domino tilings, non-intersecting Random Motions and Critical Processes Pierre van Moerbeke Université de Louvain, Belgium & Brandeis University, Massachusetts Institute of Physics, University of Edinburgh
More informationarxiv:math/ v1 [math.co] 23 Oct 1998
arxiv:math/9843v [mathco] 3 Oct 998 ENUMERATION OF TILINGS OF DIAMONDS AND HEXAGONS WITH DEFECTS HARALD HELFGOTT AND IRA M GESSEL Abstract We show how to count tilings of Aztec diamonds and hexagons with
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationLecture J. 10 Counting subgraphs Kirchhoff s Matrix-Tree Theorem.
Lecture J jacques@ucsd.edu Notation: Let [n] [n] := [n] 2. A weighted digraph is a function W : [n] 2 R. An arborescence is, loosely speaking, a digraph which consists in orienting eery edge of a rooted
More information1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018.
New Zealand Mathematical Olympiad Committee Camp Selection Problems 2018 Solutions Due: 28th September 2018 1. Suppose that a, b, c and d are four different integers. Explain why must be a multiple of
More informationSymbiosis and Reciprocity. a talk in honor of Richard A. Brualdi, RAB. April 30, 2005
Symbiosis and Reciprocity a talk in honor of Richard A. Brualdi, RAB April 30, 2005 Jim Propp Department of Mathematics University of Wisconsin - Madison slides on web at www.math.wisc.edu/ propp/brualdi.pdf
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationMathematics 220 Workshop Cardinality. Some harder problems on cardinality.
Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second
More informationDomino tilings, non-intersecting Random Motions and Integrable Systems
Domino tilings, non-intersecting Random Motions and Integrable Systems Pierre van Moerbeke Université de Louvain, Belgium & Brandeis University, Massachusetts Conference in honour of Franco Magri s 65th
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationarxiv:math/ v1 [math.co] 5 Oct 1998
RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS THERESIA EISENKÖLBL arxiv:math/98009v [math.co] 5 Oct 998 Abstract. We compute the number of rhombus tilings of a hexagon with
More informationConsider an infinite row of dominoes, labeled by 1, 2, 3,, where each domino is standing up. What should one do to knock over all dominoes?
1 Section 4.1 Mathematical Induction Consider an infinite row of dominoes, labeled by 1,, 3,, where each domino is standing up. What should one do to knock over all dominoes? Principle of Mathematical
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationA NEW COMBINATORIAL FORMULA FOR CLUSTER MONOMIALS OF EQUIORIENTED TYPE A QUIVERS
A NEW COMBINATORIAL FORMULA FOR CLUSTER MONOMIALS OF EQUIORIENTED TYPE A QUIVERS D. E. BAYLERAN, DARREN J. FINNIGAN, ALAA HAJ ALI, KYUNGYONG LEE, CHRIS M. LOCRICCHIO, MATTHEW R. MILLS, DANIEL PUIG-PEY
More informationDOMINO TILINGS INVARIANT GIBBS MEASURES
DOMINO TILINGS and their INVARIANT GIBBS MEASURES Scott Sheffield 1 References on arxiv.org 1. Random Surfaces, to appear in Asterisque. 2. Dimers and amoebae, joint with Kenyon and Okounkov, to appear
More informationCharacteristic polynomials of skew-adjacency matrices of oriented graphs
Characteristic polynomials of skew-adjacency matrices of oriented graphs Yaoping Hou Department of Mathematics Hunan Normal University Changsha, Hunan 410081, China yphou@hunnu.edu.cn Tiangang Lei Department
More informationMath 210 Exam 2 - Practice Problems. 1. For each of the following, determine whether the statement is True or False.
Math 20 Exam 2 - Practice Problems. For each of the following, determine whether the statement is True or False. (a) {a,b,c,d} TRE (b) {a,b,c,d} FLSE (c) {a,b, } TRE (d) {a,b, } TRE (e) {a,b} {a,b} FLSE
More informationEves Equihoop, The Card Game SET, and Abstract SET
Eves Equihoop, The Card Game SET, and Abstract SET Arthur Holshouser 3600 Bullard St Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 83,
More informationLecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8
Lecture 7 Feb 4, 14 Sections 1.7 and 1.8 Some problems from Sec 1.8 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness
More informationarxiv:math/ v1 [math.co] 26 Nov 1997
arxiv:math/97103v1 [math.co] 6 Nov 1997 THE NUMBER OF RHOMBUS TILINGS OF A PUNCTURED HEXAGON AND THE MINOR SUMMATION FORMULA S. Okada and C. Krattenthaler Graduate School of Polymathematics, Nagoya University
More informationDomino shuffling on Novak half-hexagons and Aztec half-diamonds
Domino shuffling on Novak half-hexagons and Aztec half-diamonds Eric Nordenstam Fakultät für Mathematik, University of Vienna, Austria eric.nordenstam@univie.ac.at Benjamin Young Department of Mathematics,
More informationClairvoyant scheduling of random walks
Clairvoyant scheduling of random walks Péter Gács Boston University April 25, 2008 Péter Gács (BU) Clairvoyant demon April 25, 2008 1 / 65 Introduction The clairvoyant demon problem 2 1 Y : WAIT 0 X, Y
More informationComplete Tripartite Graphs and their Competition Numbers
Complete Tripartite Graphs and their Competition Numbers Jaromy Kuhl Department of Mathematics and Statistics University of West Florida Jaromy Kuhl (UWF) Competition Numbers 1 / 16 Competition Graphs
More informationMAT 257, Handout 13: December 5-7, 2011.
MAT 257, Handout 13: December 5-7, 2011. The Change of Variables Theorem. In these notes, I try to make more explicit some parts of Spivak s proof of the Change of Variable Theorem, and to supply most
More informationLecture 1: Systems of linear equations and their solutions
Lecture 1: Systems of linear equations and their solutions Course overview Topics to be covered this semester: Systems of linear equations and Gaussian elimination: Solving linear equations and applications
More informationThe Pfaffian Transform
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 12 (2009), Article 0915 The Pfaffian Transform Tracale Austin 3824 Teton Pass Ellenwood, GA 30294 USA austintra@gmailcom Hans Bantilan Department of Physics
More informationUpper triangular matrices and Billiard Arrays
Linear Algebra and its Applications 493 (2016) 508 536 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Upper triangular matrices and Billiard Arrays
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationFully Packed Loops Model: Integrability and Combinatorics. Plan
ully Packed Loops Model 1 Fully Packed Loops Model: Integrability and Combinatorics Moscow 05/04 P. Di Francesco, P. Zinn-Justin, Jean-Bernard Zuber, math.co/0311220 J. Jacobsen, P. Zinn-Justin, math-ph/0402008
More informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
More informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 4 (2004), #A21 ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS Sergey Kitaev Department of Mathematics, University of Kentucky,
More informationDISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS
DISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS KOLJA B. KNAUER ABSTRACT. Propp gave a construction method for distributive lattices on a class of orientations of a graph called c-orientations. Given a distributive
More information1.10 Matrix Representation of Graphs
42 Basic Concepts of Graphs 1.10 Matrix Representation of Graphs Definitions: In this section, we introduce two kinds of matrix representations of a graph, that is, the adjacency matrix and incidence matrix
More informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture (u, v) is a horizontal edge K u,v = i (u, v) is a vertical edge 0 else
18.312: Algebraic Combinatorics Lionel Levine Lecture date: Apr 14, 2011 Lecture 18 Notes by: Taoran Chen 1 Kasteleyn s theorem Theorem 1 (Kasteleyn) Let G be a finite induced subgraph of Z 2. Define the
More informationCentral Limit Theorem for discrete log gases
Central Limit Theorem for discrete log gases Vadim Gorin MIT (Cambridge) and IITP (Moscow) (based on joint work with Alexei Borodin and Alice Guionnet) April, 205 Setup and overview λ λ 2 λ N, l i = λ
More informationExercises. Template for Proofs by Mathematical Induction
5. Mathematical Induction 329 Template for Proofs by Mathematical Induction. Express the statement that is to be proved in the form for all n b, P (n) forafixed integer b. 2. Write out the words Basis
More informationarxiv:math/ v2 [math.co] 11 Dec 1997
arxiv:math/97144v [math.co] 11 Dec 1997 THE NUMBER OF RHOMBUS TILINGS OF A SYMMETRIC HEXAGON WHICH CONTAIN A FIXED RHOMBUS ON THE SYMMETRY AXIS, I M. FULMEK AND C. KRATTENTHALER Abstract. WecomputethenumberofrhombustilingsofahexagonwithsidesN,M,N,
More informationarxiv: v2 [math.gr] 17 Dec 2017
The complement of proper power graphs of finite groups T. Anitha, R. Rajkumar arxiv:1601.03683v2 [math.gr] 17 Dec 2017 Department of Mathematics, The Gandhigram Rural Institute Deemed to be University,
More informationArctic circles, domino tilings and square Young tableaux
Arctic circles, domino tilings and square Young tableaux Dan Romik Department of Mathematics, UC Davis October 3, 1 (Revised version) Abstract The arctic circle theorem of Jockusch, Propp, and Shor asserts
More informationThe Arctic Circle re-revisited
`Workshop on Combinatorial Physics' Cardiff, 17-19 December 2013 The Arctic Circle re-revisited Filippo Colomo INFN, Firenze Joint work with: Andrei Pronko (PDMI-Steklov, Saint-Petersbourg) Domino tiling
More informationPoset and Polytope Perspectives On Alternating Sign Matrices
Poset and Polytope Perspectives On Alternating Sign Matrices A DISSERTATION SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Jessica Palencia Striker IN PARTIAL FULFILLMENT
More informationProblem 1. Let f n (x, y), n Z, be the sequence of rational functions in two variables x and y given by the initial conditions.
18.217 Problem Set (due Monday, December 03, 2018) Solve as many problems as you want. Turn in your favorite solutions. You can also solve and turn any other claims that were given in class without proofs,
More informationBijective proofs for Schur function identities which imply Dodgson s condensation formula and Plücker relations
Bijective proofs for Schur function identities which imply Dodgson s condensation formula and Plücker relations Markus Fulmek Institut für Mathematik der Universität Wien Strudlhofgasse 4, A-1090 Wien,
More informationEnumerating some symmetry classes of rhombus tilings of holey hexagons
FPSAC 2015, Daejeon, South Korea DMTCS proc. FPSAC 15, 2015, 487 498 Enumerating some symmetry classes of rhombus tilings of holey hexagons Tomack Gilmore Fakultät für Mathematik, Universität Wien, Oskar-Morgenstern-Platz
More informationGraph G = (V, E). V ={vertices}, E={edges}. V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}
Graph Theory Graph G = (V, E). V ={vertices}, E={edges}. a b c h k d g f e V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} E =16. Digraph D = (V, A). V ={vertices}, E={edges}.
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationRandom tilings and Markov chains for interlacing particles
Random tilings and Markov chains for interlacing particles Alexei Borodin Patrik L. Ferrari June 12, 2015 Abstract We explain the relation between certain random tiling models and interacting particle
More informationAcyclic and Oriented Chromatic Numbers of Graphs
Acyclic and Oriented Chromatic Numbers of Graphs A. V. Kostochka Novosibirsk State University 630090, Novosibirsk, Russia X. Zhu Dept. of Applied Mathematics National Sun Yat-Sen University Kaohsiung,
More information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel
More information1 Homework. Recommended Reading:
Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis
More informationThe dimer model: universality and conformal invariance. Nathanaël Berestycki University of Cambridge. Colloque des sciences mathématiques du Québec
The dimer model: universality and conformal invariance Nathanaël Berestycki University of Cambridge Colloque des sciences mathématiques du Québec The dimer model Definition G = bipartite finite graph,
More informationPartitions and Algebraic Structures
CHAPTER A Partitions and Algebraic Structures In this chapter, we introduce partitions of natural numbers and the Ferrers diagrams. The algebraic structures of partitions such as addition, multiplication
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationAppendix G: Mathematical Induction
Appendix G: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationCounting Clusters on a Grid
Dartmouth College Undergraduate Honors Thesis Counting Clusters on a Grid Author: Jacob Richey Faculty Advisor: Peter Winkler May 23, 2014 1 Acknowledgements There are a number of people who have made
More informationRATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS. February 6, 2006
RATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS ATOSHI CHOWDHURY, LESLIE HOGBEN, JUDE MELANCON, AND RANA MIKKELSON February 6, 006 Abstract. A sign pattern is a
More informationHomework 3 Solutions, Math 55
Homework 3 Solutions, Math 55 1.8.4. There are three cases: that a is minimal, that b is minimal, and that c is minimal. If a is minimal, then a b and a c, so a min{b, c}, so then Also a b, so min{a, b}
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationAn Introduction to Combinatorial Species
An Introduction to Combinatorial Species Ira M. Gessel Department of Mathematics Brandeis University Summer School on Algebraic Combinatorics Korea Institute for Advanced Study Seoul, Korea June 14, 2016
More informationCombinatorics of the Del-Pezzo 3 Quiver: Aztec Dragons, Castles, and Beyond
Combinatorics of the Del-Pezzo Quiver: Aztec Dragons, Castles, and Beyond Tri Lai (IMA) and Gregg Musiker (University of Minnesota) AMS Special Session on Integrable Combinatorics March, 0 http//math.umn.edu/
More informationMath 5707: Graph Theory, Spring 2017 Midterm 3
University of Minnesota Math 5707: Graph Theory, Spring 2017 Midterm 3 Nicholas Rancourt (edited by Darij Grinberg) December 25, 2017 1 Exercise 1 1.1 Problem Let G be a connected multigraph. Let x, y,
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
More informationSchur processes and dimer models
Schur processes and dimer models Jérémie Bouttier Based on joint works with Dan Betea, Cédric Boutillier, Guillaume Chapuy, Sylvie Corteel, Sanjay Ramassamy and Mirjana Vuletić Institut de Physique Théorique,
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationMinimum number of non-zero-entries in a 7 7 stable matrix
Linear Algebra and its Applications 572 (2019) 135 152 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Minimum number of non-zero-entries in a
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationEconomics 204 Fall 2011 Problem Set 1 Suggested Solutions
Economics 204 Fall 2011 Problem Set 1 Suggested Solutions 1. Suppose k is a positive integer. Use induction to prove the following two statements. (a) For all n N 0, the inequality (k 2 + n)! k 2n holds.
More informationThe Aztec Diamond Edge-Probability Generating Function. Peng (Peter) Du A THESIS. Mathematics
The Aztec Diamond Edge-Probability Generating Function Peng (Peter) Du A THESIS in Mathematics Presented to the Faculties of the University of Pennsylvania in Partial Fulfillment of the Requirements for
More informationInternational Mathematics TOURNAMENT OF THE TOWNS
International Mathematics TOURNAMENT OF THE TOWNS Senior A-Level Paper Fall 2008. 1. A standard 8 8 chessboard is modified by varying the distances between parallel grid lines, so that the cells are rectangles
More informationAiry and Pearcey Processes
Airy and Pearcey Processes Craig A. Tracy UC Davis Probability, Geometry and Integrable Systems MSRI December 2005 1 Probability Space: (Ω, Pr, F): Random Matrix Models Gaussian Orthogonal Ensemble (GOE,
More informationB. Appendix B. Topological vector spaces
B.1 B. Appendix B. Topological vector spaces B.1. Fréchet spaces. In this appendix we go through the definition of Fréchet spaces and their inductive limits, such as they are used for definitions of function
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationDomino shuffling and TASEP. Xufan Zhang. Brown Discrete Math Seminar, March 2018
Domino shuffling and TASEP Xufan Zhang Brown Discrete Math Seminar, March 2018 Table of Contents 1 Domino tilings in an Aztec diamond 2 Domino shuffling 3 Totally asymmetric simple exclusion process(tasep)
More informationMOMENTS OF INERTIA ASSOCIATED WITH THE LOZENGE TILINGS OF A HEXAGON
Séminaire Lotharingien de Combinatoire 45 001, Article B45f MOMENTS OF INERTIA ASSOCIATED WITH THE LOZENGE TILINGS OF A HEXAGON ILSE FISCHER Abstract. Consider the probability that an arbitrary chosen
More informationWe simply compute: for v = x i e i, bilinearity of B implies that Q B (v) = B(v, v) is given by xi x j B(e i, e j ) =
Math 395. Quadratic spaces over R 1. Algebraic preliminaries Let V be a vector space over a field F. Recall that a quadratic form on V is a map Q : V F such that Q(cv) = c 2 Q(v) for all v V and c F, and
More informationMATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.
MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described
More information