Related papers: Tilings of damaged hexagons
Given a collection of N rectangles such that the side ratio of each one is a quadratic irrationality, we find all rectangles which can be tiled by rectangles similar to one of the given ones. It means that each possible shape can be used…
We compute the number of rhombus tilings of a hexagon with side lengths a,b,c,a,b,c which contain the central rhombus and the number of rhombus tilings of a hexagon with side lengths a,b,c,a,b,c which contain the `almost central` rhombus…
In this paper we consider uniformly random lozenge tilings of arbitrary domains approximating (after suitable normalization) a closed, simply-connected subset of $\mathbb{R}^2$ with piecewise smooth, simple boundary. We show that the local…
Here I present several theorems about trapezoids tilings. The first one is related to trapezoids with rational base relation, the other ones are related to those with base relation from quadratic number field.
Decorating the Spectre tile with hexagons reveals triangular hexagonal clusters whose structure we study. In the process we reprove that the Spectre tilings exist and are uniquely hierarchical. The proof is not computer-assisted.
We study two recent conjectures for holographic complexity: the complexity=action conjecture and the complexity=volume conjecture. In particular, we examine the structure of the UV divergences appearing in these quantities, and show that…
We consider tilings of the plane with 12-fold symmetry obtained by the cut and projection method. We compute their cohomology groups using the techniques introduced by the second author, Hunton and Kellendonk. To do this we completely…
We study the tiling of a two-dimensional region of the plane by $K$-cell one-dimensional tiles, or $K$-mers. Unlike previous studies, which typically allowed for one single value of $K$ or sometimes a small assortment of fixed values, here…
Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…
Every normal periodic tiling is a strongly balanced tiling. The properties of periodic tilings by convex polygons are rearranged from the knowledge of strongly balanced tilings. From the results, we show the properties of representative…
We study nonperiodic tilings of the line obtained by a projection method with an interval projection structure. We obtain a geometric characterisation of all interval projection tilings that admit substitution rules and describe the set of…
In this paper, we give some sufficient conditions for a $n$-dimensional rectangle to be tiled with a set of bricks. These conditions are obtained by using the so-called Frobenius number.
A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…
One well studied way to construct quasicrystalline tilings is via inflate-and-subdivide (a.k.a. substitution) rules. These produce self-similar tilings--the Penrose, octagonal, and pinwheel tilings are famous examples. We present a…
We compute the number of rhombus tilings of a hexagon with sides $N,M,N,N,M,N$, which contain a fixed rhombus on the symmetry axis. A special case solves a problem posed by Jim Propp.
We compute the number of rhombus tilings of a hexagon with sides n, n, N, n, n, N, where two triangles on the symmetry axis touching in one vertex are removed. The case of the common vertex being the center of the hexagon solves a problem…
We study the weighted partition function for lozenge tilings, with weights given by multivariate rational functions originally defined by Morales, Pak and Panova (2019) in the context of the factorial Schur functions. We prove that this…
We consider the dynamics of light rays in the trihexagonal tiling where triangles and hexagons are transparent and have equal but opposite indices of refraction. We find that almost every ray of light is dense in a region of a particular…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…