Related papers: Enumeration of tilings of quartered Aztec rectangl…
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…
This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the…
This paper studies random lozenge tilings of general non-convex polygonal regions. We show that the pairwise interaction of the non-convexities leads asymptotically to new kernels and thus to new statistics for the tiling fluctuations. The…
Knecht considers the enumeration of coronas. This is a counting problem for two specific types of lozenge tilings. Their exact closed formulas are conjectured in [A380346] and [A380416] on the OEIS. We prove this conjecture by using the…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
In this paper, we study the embedded topology of smooth plane quartics and its bitangent lines via two-graphs and apply it to construct interesting examples for Zariski $m$-ple.
Aperiodic tiling is a well-know area of research. First developed by mathematicians for the mathematical challenge they represent and the beauty of their resulting patterns, they became a growing field of interest when their practical use…
A famous result of D. Walkup is that an $m\times n$ rectangle may be tiled by T-tetrominos if and only if both $m$ and $n$ are multiples of 4. The "if" portion may be proved by tiling a $4\times 4$ block, and then copying that block to fill…
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is defined over a principal ideal domain, this is equivalent to…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
We present a method for generating hexagonal aperiodic tilings that are topologically equivalent to the triangular and dice lattices. This approach incorporates aperiodic sequences into the spacing between three sets of grids for the…
We describe several general methods for calculating weights of mixed tilting sheaves. We introduce a notion called "non-cancellation property" which implies a strong uniqueness of mixed tilting sheaves and enables one to calculate their…
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…
In this paper we consider arbitrary hexagons on the triangular lattice with three arbitrary bowtie-shaped holes, whose centers form an equilateral triangle. The number of lozenge tilings of such general regions is not expected --- and…
Matt Blum conjectured that the number of tilings of a hexagonal dungeon with side-lengths $a,2a,b,a,2a,b$ (for $b\geq2a$) equals $13^{2a^2}14^{\lfloor a^2/2\rfloor}$. Ciucu and the author of the present paper proved the conjecture by using…
In this paper we enumerate the centrally symmetric lozenge tilings of a hexagon with a fern removed from its center. The proof is based on a variant of Kuo's graphical condensation method. An unexpected connection with the total number of…
Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
A set of tiles for covering a surface is composed of two types of tiles. The base shape of each one of them is a diamond or rhombus, both with angles 60 and 120 degrees. They are distinguished by labeling one as an acute diamond with a base…
We introduce a square tiling/tetragonal strip representation to the P, D, and G triply periodic minimal surfaces. This approach is useful in identifying mixtures and grain boundaries of these surfaces that might be useful for material…