Related papers: A Simple Proof of the Aztec Diamond Theorem

We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several…

We provide a proof of the Alpern multi-tower theorem for Z^d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z^d action by a collection of rectangles whose corresponding sides have no non-trivial common…

This paper explores the connection between perfect t-embeddings and the octahedron equation in the setting of the two-periodic Aztec diamond. In particular, we show that the positions of both the t-embedding and the corresponding origami…

The inverse Kasteleyn matrix of a bipartite graph holds much information about the perfect matchings of the system such as local statistics which can be used to compute local and global asymptotics. In this paper, we consider three…

Inspired by Propp's intruded Aztec diamond regions, we consider halved hexagons in which two aligned arrays of triangular holes have been removed from their boundaries. Unlike the intruded Aztec diamonds (whose numbers of domino tilings…

Helfgott and Gessel gave the number of domino tilings of an Aztec Rectangle with defects of size one on the boundary of one side. In this paper we extend this to the case of domino tilings of an Aztec Rectangle with defects on all boundary…

We prove that the, appropriately rescaled, boundary of the north polar region in the Aztec diamond converges to the Airy process. The proof uses certain determinantal point processes given by the extended Krawtchouk kernel. We also prove a…

We give a bijective proof of a conjecture of Regev and Vershik on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture,…

We compare two methods for analysing periodic dimer models. These are the matrix-valued orthogonal polynomials approach due to Duits and one of the authors, and the Wiener-Hopf approach due to Berggren and Duits. We establish their…

In the last decade there have been many results about special families of graphs whose number of perfect matchings is given by perfect or near perfect powers. In this paper we present an approach that allows proving them in a unified way.…

We study the correlation functions for determinantal point processes defined by products of infinite minors of block Toeplitz matrices. The motivation for studying such processes comes from doubly periodically weighted tilings of planar…

We are counting the lattice rectangles that can be constructed inside several planar shapes and identify the corresponding sequences in the OEIS.

This paper gives a generic form of the diamond lemma, which includes support for additive and topological structures of the base set, and which does not require any further structure (e.g. an associative multiplication operation) to be…

We study the asymptotic behavior of random dimer coverings of the one-periodic Aztec diamond in random environment. We investigate quenched limit theorems for the height function and we extend annealed limit theorems that were recently…

We introduce a new class of discrete approximations of planar domains that we call "hedgehog domains". In particular, this class of approximations contains two-step Aztec diamonds and similar shapes. We show that fluctuations of the height…

I give simple elementary proofs for some well-known Hankel determinants and their q-analogues.

In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].

We isolate \emph{the approximating diamond principles}, which are consequences of the diamond principle at an inaccessible cardinal. We use these principles to find new methods for negating the diamond principle at large cardinals. Most…

Let $T$ be a tile in $\mathbb{Z}^n$, meaning a finite subset of $\mathbb{Z}^n$. It may or may not tile $\mathbb{Z}^n$, in the sense of $\mathbb{Z}^n$ having a partition into copies of $T$. However, we prove that $T$ does tile $\mathbb{Z}^d$…

We consider generalizations of Szpiro's classical discriminant conjecture to hyperelliptic curves over a number field $K$, and to smooth, projective and geometrically connected curves $X$ over $K$ of genus at least one. The main results…