MONOMER CORRELATIONS ON THE SQUARE LATTICE. Mihai Ciucu Indiana University Department of Mathematics, Bloomington, IN 47405, USA
|
|
- Paul Powers
- 5 years ago
- Views:
Transcription
1 MONOMER CORRELATIONS ON THE SQUARE LATTICE Mihai Ciucu Indiana University Department of Mathematics, Bloomington, IN 4745, USA
2 Domino tilings Domino tilings are equivalent to perfect matchings. M(G) := # perfect matchings of graph G. Let G n :=n n grid graph. Dimer problem on square lattice (936): M(G 2n ) =?
3 Theorem (Kasteleyn, and independently Temperley and Fisher, 96). M(G 2n ) = 2 2n2 n n j= k= ( cos 2 jπ 2n + + cos2 ) kπ. 2n +
4 Monomer-monomer correlation in a sea of dimers 2 n ( p,q) M (,) ω p,q = lim n oo 2 n M Fisher and Stephenson (963): conjectured (from exact data) that ω 2p+, c d((2p +, ), (, )) ω p+,p c d((p +, p), (, )) as p, with same c.
5 Based on this, they conjectured that ω p,q is rotationally invariant for p k /q k s, k, over all slopes s. This still stands open. It s analogous to the rotational invariance of the spin-spin correlation in Ising model.
6 Emergence of Coulomb s law In previous work we: Generalized the problem to an arbitrary finite collection of holes of any sizes For large classes we proved that asymptotics of joint correlation function is given by Coulomb s law: White unit holes charge +, blacks, for larger holes define charge q additively. Then ω(o,..., O n ) C i<j n for large separations between the holes. d(o i, O j ) 2 q(o i) q(o j ) This casts the Fisher-Stephenson conjecture in the more general light of Coulomb interactions: For two opposite color monomers, the exponent is 2 ()( ), and above formula specializes to the FS conjecture.
7 The Aztec diamond graph The Aztec diamond AD 4. Theorem (Elkies, Kuperberg, Larsen, and Propp, 992). M(AD n ) = 2 n(n+)/2.
8 Alternative definition: via Aztec rectangles Defect clusters consisting of holes and separations Define ω by limits of ratios of dimer coverings of these.
9 The dual picture: holes in domino tilings A defect cluster is equivalent to averaging over holes like this (over 4 s such holes, if there are s separation defects in the defect cluster). Key red: hole gold: point of separation green: induced by dimers covering points of separation The union of gold and green needs to split into disjoint I s and L s:
10 Factorization Theorem (C., 997) G planar, weighted, bipartite, symmetric graph l There is a specific way to cut G into G +, G a a b b a b /2 /2 so that we have: M(G) = 2 w(g) M(G + ) M(G ).
11 Apply factorization theorem:
12 Both connected components are Aztec rectangles with missing vertices along a side their number of perfect matchings turns out to have a simple product formula.
13 We have: M(AR(m, n; S)) = A ASM(m,n;S) 2 N +(A) = 2 m 2 N (A). A ASM(m,n;S)
14 Monotone triangle: all rows are strictly increasing the numbers are non-decreasing in the polar directions +6 and 6. s(t ) = the number of elements of T that are strictly between their neighbors in the row below weight every monotone triangle T by 2 s(t ) f(t,..., t m ) denotes total weight of monotone triangles with bottom row {t,..., t m } We have A ASM(m,n;S) 2 N (A) = f(t,..., t m ) By a result of Mills Robbins and Rumsey (983) we have f(t,..., t m ) = 2 m(m )/2!! (m )! (t j t i ). i<j m
15 Consequences of the product formula Get exact correlations of arbitrary collinear holes along the diagonal of the square lattice In the limit of large separations Coulomb s law emerges again Can determine asymptotics of correlation for arbitrary defect clusters along diagonal direction.
16 ω: obtained by normalizing in a different way in the definition of ω As R we can verify Strong Superposition Principle (collinear defect clusters) ω(d (Rx ),..., D n (Rx n )) ω(d i ) i n i<j n where d is the Euclidean distance. d(d i (Rx i ), D j (Rx j )) 2 q(d i) q(d j ),
17 Special case: Two unit holes on the diagonal. When squares have opposite color we have by Hartwig (966) that with B = ω(, ) B d(, ) /2, By definition ω( ) = ω( ) = B. Also expect ω(, ) = ω(, ). Then ω(, ) ω( ) 2 d(, ) /2. Claim. ω(, ) ω( ) 2 d(, ) /2. Justification. We should have ω(, ) ω( ) = ω(, ) ω( ) A d(, )/2 ω(, ) ω( ) 2 d(, ) 2 and ω(, ) = ˆω(, ). Latter is π 2 d(, ) 2 by Kenyon s determinant formula. And indeed: B = A π.
18 Moessner and Sondhi (22), based on Monte Carlo simulation, predicted Coulomb repulsion between same color monomers in large squares on the square lattice, but with multiplicative constant increasing with the size of the system. Above shows this is not the case in fact we get same multiplicative constant as for monomers of opposite colors.
19 Conjecture. Same is true for arbitrary, not necessary collinear defect clusters. Remark. We proved the analog of this conjecture for a large class of hole defects on the triangular lattice.
20 Correlation inequalities ω(m, m 2, m 3 ) ω(m, m 2 ) ω(m, m 3 ) ω(m 2, m 3 ) ω(m ) ω(m 2 ) ω(m 3 ) Form is reminiscent of GHS inequality for spin correlations: σ i σ j σ k σ i σ j σ k σ i σ k σ j σ j σ k σ i +2 σ i σ j σ k Can be proved using our exact product formulas and error bounds for the Barnes G-function G(n) =!! (n 2)!
21 Some questions. Is this inequality true for any three same-color monomers (not necessarily collinear)? 2. What about more than 3 monomers? 3. What if not all monomers have same color? 4. Larger holes?
22 Remarks about doing the calculations Exact raw formula Can be interpreted as gas of alternating atoms filling unaffected sites, with likes repelling Coulomb style, unlikes noninteracting This brings about Coulomb interaction between affected sites (likes repell, unlikes attract) Compare ratios of configurations differing by unit dislocation of single affected site, or switching two adjacent affected sites of opposite types. Instances of exactness : ratio of correlations of nearby configurations exactly equals ratio of SP contributions (in general they are only asymptotically equal)
23 The key fact that allows this solution: That with the right averaging, correlations at finite distance have simple explicit expressions.
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 informationProof of a generalization of Aztec diamond theorem
Proof of a generalization of Aztec diamond theorem Institute for Mathematics and its Applications University of Minnesota Minneapolis, MN 55455 December 5, 2014 Aztec Diamond Theorem Definition The Aztec
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 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 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 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 information2D Tiling: Domino, Tetromino and Percolation
2D Tiling: Domino, Tetromino and Percolation D. V. Chudnovsky, G.V. Chudnovsky IMAS NYU Polytechnic School of Engineering 6MetroTechCenter Brooklyn, NY 11201 March 5, 2015 March 26, 2015 General Definitions
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 informationDimer Problems. Richard Kenyon. August 29, 2005
Dimer Problems. Richard Kenyon August 29, 25 Abstract The dimer model is a statistical mechanical model on a graph, where configurations consist of perfect matchings of the vertices. For planar graphs,
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 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 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 informationarxiv: v2 [math.pr] 26 Aug 2017
CONSTRAINED PERCOLATION, ISING MODEL AND XOR ISING MODEL ON PLANAR LATTICES ZHONGYANG LI arxiv:1707.04183v2 [math.pr] 26 Aug 2017 Abstract. We study constrained percolation models on planar lattices including
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 informationCONSTRAINED PERCOLATION ON Z 2
CONSTRAINED PERCOLATION ON Z 2 ZHONGYANG LI Abstract. We study a constrained percolation process on Z 2, and prove the almost sure nonexistence of infinite clusters and contours for a large class of probability
More informationBéatrice de Tilière. Université Pierre et Marie Curie, Paris. Young Women in Probability 2014, Bonn
ASPECTS OF THE DIMER MODEL, SPANNING TREES AND THE ISING MODEL Béatrice de Tilière Université Pierre et Marie Curie, Paris Young Women in Probability 2014, Bonn INTRODUCTION STATISTICAL MECHANICS Understand
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 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 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 informationSpanning trees on the Sierpinski gasket
Spanning trees on the Sierpinski gasket Shu-Chiuan Chang (1997-2002) Department of Physics National Cheng Kung University Tainan 70101, Taiwan and Physics Division National Center for Theoretical Science
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 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 informationAntiferromagnetic Potts models and random colorings
Antiferromagnetic Potts models and random colorings of planar graphs. joint with A.D. Sokal (New York) and R. Kotecký (Prague) October 9, 0 Gibbs measures Let G = (V, E) be a finite graph and let S be
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 informationCluster algebras, snake graphs and continued fractions. Ralf Schiffler
Cluster algebras, snake graphs and continued fractions Ralf Schiffler Intro Cluster algebras Continued fractions Snake graphs Intro Cluster algebras Continued fractions expansion formula via perfect matchings
More informationPhysica A 387 (2008) Contents lists available at ScienceDirect. Physica A. journal homepage:
Physica A 387 (8) 669 678 Contents lists available at ScienceDirect Physica A ournal homepage: wwwelseviercom/locate/physa Dimer problem on the cylinder and torus Weigen Yan a, Yeong-Nan Yeh b, Fui Zhang
More informationParamagnetic phases of Kagome lattice quantum Ising models p.1/16
Paramagnetic phases of Kagome lattice quantum Ising models Predrag Nikolić In collaboration with T. Senthil Massachusetts Institute of Technology Paramagnetic phases of Kagome lattice quantum Ising models
More informationComputational Complexity Theory. The World of P and NP. Jin-Yi Cai Computer Sciences Dept University of Wisconsin, Madison
Computational Complexity Theory The World of P and NP Jin-Yi Cai Computer Sciences Dept University of Wisconsin, Madison Sept 11, 2012 Supported by NSF CCF-0914969. 1 2 Entscheidungsproblem The rigorous
More informationDynamics and Thermodynamics of Artificial Spin Ices - and the Role of Monopoles
Dynamics and Thermodynamics of Artificial Spin Ices - and the Role of Monopoles Gunnar Möller Cavendish Laboratory University of Cambridge Roderich Moessner Max Planck Institute for the Physics of Complex
More informationStatistical Mechanics and Combinatorics : Lecture IV
Statistical Mechanics and Combinatorics : Lecture IV Dimer Model Local Statistics We ve already discussed the partition function Z for dimer coverings in a graph G which can be computed by Kasteleyn matrix
More informationDimers on two-dimensional lattices
arxiv:cond-mat/33251v4 [cond-mat.stat-mech] 13 Apr 23 Dimers on two-dimensional lattices F. Y. Wu Department of Physics Mortheastern University Boston, Massachusetts 2115, USA March 6, 28 Abstract We consider
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 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 informationAdvanced Topics in Probability
Advanced Topics in Probability Conformal Methods in 2D Statistical Mechanics Pierre Nolin Different lattices discrete models on lattices, in two dimensions: square lattice Z 2 : simplest one triangular
More informationA reciprocity theorem for domino tilings
A reciprocity theorem for domino tilings James Propp Department of Mathematics University of Wisconsin Madison, Wisconsin, USA propp@math.wisc.edu Submitted: April 1, 2001; Accepted: April 30, 2001 MR
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 informationΩ = e E d {0, 1} θ(p) = P( C = ) So θ(p) is the probability that the origin belongs to an infinite cluster. It is trivial that.
2 Percolation There is a vast literature on percolation. For the reader who wants more than we give here, there is an entire book: Percolation, by Geoffrey Grimmett. A good account of the recent spectacular
More informationGeometry, topology and frustration: the physics of spin ice
Geometry, topology and frustration: the physics of spin ice Roderich Moessner CNRS and LPT-ENS 9 March 25, Magdeburg Overview Spin ice: experimental discovery and basic model Spin ice in a field dimensional
More informationSome Polyomino Tilings of the Plane
Some Polyomino Tilings of the Plane Cristopher Moore SFI WORKING PAPER: 1999-04-03 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of
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 informationApplications of Convex Optimization on the Graph Isomorphism problem
Applications of Convex Optimization on the Graph Isomorphism problem 1 1 Department of Information and Computer Sciences UC Irvine March 8, 2011 Outline Motivation 1 Motivation The Graph Isomorphism problem
More informationDeterminant density and the Vol-Det Conjecture
Determinant density and the Vol-Det Conjecture Ilya Kofman College of Staten Island and The Graduate Center City University of New York (CUNY) Joint work with Abhijit Champanerkar and Jessica Purcell December
More informationTowards conformal invariance of 2-dim lattice models
Towards conformal invariance of 2-dim lattice models Stanislav Smirnov Université de Genève September 4, 2006 2-dim lattice models of natural phenomena: Ising, percolation, self-avoiding polymers,... Realistic
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 informationRandom Lifts of Graphs
27th Brazilian Math Colloquium, July 09 Plan of this talk A brief introduction to the probabilistic method. A quick review of expander graphs and their spectrum. Lifts, random lifts and their properties.
More informationDomino Tilings with Barriers
Journal of Cominatorial Theory, Series A 87, 347356 (1999) Article ID jcta.1999.2967, availale online at http:www.idealirary.com on Domino Tilings with Barriers James Propp Department of Mathematics, University
More informationDimer model implementations of quantum loop gases. C. Herdman, J. DuBois, J. Korsbakken, K. B. Whaley UC Berkeley
Dimer model implementations of quantum loop gases C. Herdman, J. DuBois, J. Korsbakken, K. B. Whaley UC Berkeley Outline d-isotopic quantum loop gases and dimer model implementations generalized RK points
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 informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationPaul Erdős and Graph Ramsey Theory
Paul Erdős and Graph Ramsey Theory Benny Sudakov ETH and UCLA Ramsey theorem Ramsey theorem Definition: The Ramsey number r(s, n) is the minimum N such that every red-blue coloring of the edges of a complete
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 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 informationThree-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies Zdeněk Dvořák Daniel Král Robin Thomas Abstract We settle a problem of Havel by showing that there exists
More informationMaximum Alliance-Free and Minimum Alliance-Cover Sets
Maximum Alliance-Free and Minimum Alliance-Cover Sets Khurram H. Shafique and Ronald D. Dutton School of Computer Science University of Central Florida Orlando, FL USA 3816 hurram@cs.ucf.edu, dutton@cs.ucf.edu
More informationA reverse Sidorenko inequality Independent sets, colorings, and graph homomorphisms
A reverse Sidorenko inequality Independent sets, colorings, and graph homomorphisms Yufei Zhao (MIT) Joint work with Ashwin Sah (MIT) Mehtaab Sawhney (MIT) David Stoner (Harvard) Question Fix d. Which
More informationMACHINE LEARNING - CS671 - Part 2a The Vapnik-Chervonenkis Dimension
MACHINE LEARNING - CS671 - Part 2a The Vapnik-Chervonenkis Dimension Prof. Dan A. Simovici UMB Prof. Dan A. Simovici (UMB) MACHINE LEARNING - CS671 - Part 2a The Vapnik-Chervonenkis Dimension 1 / 30 The
More informationCFT and SLE and 2D statistical physics. Stanislav Smirnov
CFT and SLE and 2D statistical physics Stanislav Smirnov Recently much of the progress in understanding 2-dimensional critical phenomena resulted from Conformal Field Theory (last 30 years) Schramm-Loewner
More informationA third-order phase transition in random domino tilings
Statistical Field Theory, Low-Dimensional Systems, Integrable Models and Applications Firenze, 6-7 Giugno 2013 A third-order phase transition in random domino tilings Filippo Colomo INFN, Firenze Joint
More informationLecture 5: January 30
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 5: January 30 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationÖsszefonódás és felületi törvény 2. Szabad rácsmodellek
Összefonódás és felületi törvény 2. Szabad rácsmodellek Eisler Viktor MTA-ELTE Elméleti Fizikai Kutatócsoport Entanglement Day 2014.09.05. I. Peschel & V. Eisler, J. Phys. A: Math. Theor. 42, 504003 (2009)
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 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 informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More informationExtremal H-colorings of graphs with fixed minimum degree
Extremal H-colorings of graphs with fixed minimum degree John Engbers July 18, 2014 Abstract For graphs G and H, a homomorphism from G to H, or H-coloring of G, is a map from the vertices of G to the vertices
More informationUniformly Random Lozenge Tilings of Polygons on the Triangular Lattice
Interacting Particle Systems, Growth Models and Random Matrices Workshop Uniformly Random Lozenge Tilings of Polygons on the Triangular Lattice Leonid Petrov Department of Mathematics, Northeastern University,
More informationStatistical Mechanics and Combinatorics : Lecture I
Statistical Mechanics and Combinatorics : Lecture I 1 Overview We are considering interactions between three fields of mathematics: combinatorics, statistics and probability In short, combinatorics is
More informationLecture 18 Classical Iterative Methods
Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,
More informationOn (δ, χ)-bounded families of graphs
On (δ, χ)-bounded families of graphs András Gyárfás Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63 Budapest, Hungary, H-1518 gyarfas@sztaki.hu Manouchehr
More informationPOLYOMINOES WITH MINIMUM SITE-PERIMETER AND FULL SET ACHIEVEMENT GAMES. Nándor Sieben
POLYOMINOES WITH MINIMUM SITE-PERIMETER AN FULL SET ACHIEVEMENT GAMES Nándor Sieben Abstract The site-perimeter of a polyomino is the number of empty cells connected to the polyomino by an edge. A formula
More informationBounds on the generalised acyclic chromatic numbers of bounded degree graphs
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs Catherine Greenhill 1, Oleg Pikhurko 2 1 School of Mathematics, The University of New South Wales, Sydney NSW Australia 2052,
More informationParity Dominating Sets in Grid Graphs
Parity Dominating Sets in Grid Graphs John L. Goldwasser and William F. Klostermeyer Dept. of Mathematics West Virginia University Morgantown, WV 26506 Dept. of Computer and Information Sciences University
More informationPolynomial-time classical simulation of quantum ferromagnets
Polynomial-time classical simulation of quantum ferromagnets Sergey Bravyi David Gosset IBM PRL 119, 100503 (2017) arxiv:1612.05602 Quantum Monte Carlo: a powerful suite of probabilistic classical simulation
More informationFrom alternating sign matrices to Painlevé VI
From alternating sign matrices to Painlevé VI Hjalmar Rosengren Chalmers University of Technology and University of Gothenburg Nagoya, July 31, 2012 Hjalmar Rosengren (Chalmers University) Nagoya, July
More informationHigh-dimensional permutations and discrepancy
High-dimensional permutations and discrepancy BIRS Meeting, August 2016 What are high dimensional permutations? What are high dimensional permutations? A permutation can be encoded by means of a permutation
More informationarxiv:math-ph/ v1 1 Oct 1999
Conformal invariance of domino tiling arxiv:math-ph/99v Oct 999 Richard Kenyon February 6, 8 Abstract Let U be a multiply-connected region in R with smooth boundary. Let P be a polyomino in Z approximating
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationThe near-critical planar Ising Random Cluster model
The near-critical planar Ising Random Cluster model Gábor Pete http://www.math.bme.hu/ gabor Joint work with and Hugo Duminil-Copin (Université de Genève) Christophe Garban (ENS Lyon, CNRS) arxiv:1111.0144
More informationStabilization and Acceleration of Algebraic Multigrid Method
Stabilization and Acceleration of Algebraic Multigrid Method Recursive Projection Algorithm A. Jemcov J.P. Maruszewski Fluent Inc. October 24, 2006 Outline 1 Need for Algorithm Stabilization and Acceleration
More informationClinton Community School District K-8 Mathematics Scope and Sequence
6_RP_1 6_RP_2 6_RP_3 Domain: Ratios and Proportional Relationships Grade 6 Understand the concept of a ratio and use ratio language to describe a ratio relationship between two quantities. Understand the
More informationSimulations of Quantum Dimer Models
Simulations of Quantum Dimer Models Didier Poilblanc Laboratoire de Physique Théorique CNRS & Université de Toulouse 1 A wide range of applications Disordered frustrated quantum magnets Correlated fermions
More informationAn n-dimensional Generalization of the Rhombus Tiling
Discrete Mathematics and Theoretical Computer Science Proceedings AA (DM-CCG), 2001, 23 42 An n-dimensional Generalization of the Rhombus Tiling Joakim Linde 1, Cristopher Moore 2 3, and Mats G. Nordahl
More informationCAHSEE Math Released Test Questions
Math Released Test Questions RTQ Item Numbers by Standard (Includes CST items for Standards on ) This document references Released Test Questions from the 2008 posted Test Questions (RTQs) and the 2003
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More information1 Notation. 2 Sergey Norin OPEN PROBLEMS
OPEN PROBLEMS 1 Notation Throughout, v(g) and e(g) mean the number of vertices and edges of a graph G, and ω(g) and χ(g) denote the maximum cardinality of a clique of G and the chromatic number of G. 2
More informationOptimal configurations for classical interacting particles
Optimal configurations for classical interacting particles Edoardo Mainini DIME, Università degli Studi di Genova, & Facoltà di Matematica, Università di Vienna Joint research with Ulisse Stefanelli, Paolo
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 information3 : Representation of Undirected GM
10-708: Probabilistic Graphical Models 10-708, Spring 2016 3 : Representation of Undirected GM Lecturer: Eric P. Xing Scribes: Longqi Cai, Man-Chia Chang 1 MRF vs BN There are two types of graphical models:
More informationPerfect matchings for the three-term Gale-Robinson sequences
Perfect matchings for the three-term Gale-Robinson sequences Mireille Bousquet-Mélou, James Propp, Julian West To cite this version: Mireille Bousquet-Mélou, James Propp, Julian West. Perfect matchings
More informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationThe many faces of alternating-sign matrices
The many faces of alternating-sign matrices James Propp Department of Mathematics University of Wisconsin Madison, Wisconsin, USA propp@math.wisc.edu August 15, 2002 Abstract I give a survey of different
More informationUniformization and percolation
Uniformization and percolation Itai Benjamini May 2016 Conformal maps A conformal map, between planar domains, is a function that infinitesimally preserves angles. The derivative of a conformal map is
More informationThe Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs. Mark C. Kempton
The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs Mark C. Kempton A thesis submitted to the faculty of Brigham Young University in partial fulfillment of the requirements for
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 informationEfficient packing of unit squares in a square
Loughborough University Institutional Repository Efficient packing of unit squares in a square This item was submitted to Loughborough University's Institutional Repository by the/an author. Additional
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationRandom geometric analysis of the 2d Ising model
Random geometric analysis of the 2d Ising model Hans-Otto Georgii Bologna, February 2001 Plan: Foundations 1. Gibbs measures 2. Stochastic order 3. Percolation The Ising model 4. Random clusters and phase
More informationCBSSS 6/25/02. Physics becomes the. Computing Beyond Silicon Summer School. computer. Norm Margolus
Computing Beyond Silicon Summer School Physics becomes the computer Norm Margolus Physics becomes the computer 0/1 Emulating Physics» Finite-state, locality, invertibility, and conservation laws Physical
More information6 th Grade MCA3 Standards, Benchmarks, Examples, Test Specifications & Sampler Questions
6 th Grade 3 Standards, Benchmarks, Examples, Test Specifications & Sampler Questions Strand Standard No. Benchmark (6 th Grade) Sampler Item Number & Operation 14-18 9-12 Read, write, represent and compare
More informationPercolation and Random walks on graphs
Percolation and Random walks on graphs Perla Sousi May 14, 2018 Contents 1 Percolation 2 1.1 Definition of the model................................... 2 1.2 Coupling of percolation processes.............................
More information