Related papers: Domino tiling in grid - new dependence
In this note we use techniques in the topology of 2-complexes to recast some tools that have arisen in the study of planar tiling questions. With spherical pictures we show that the tile counting group associated to a set $T$ of tiles and a…
Results of research of possibility of transformation of a difference equation into a system of the first-order difference equation are presented. In contrast to the method used previously, an unknown grid function is split into two new…
Two new series of substitution tilings are introduced in which the tiles appear in infinitely many orientations. It is shown that several properties of the well-known pinwheel tiling do also hold for these new examples, and, in fact, for…
We study convex domino towers using a classic dissection technique on polyominoes to find the generating function and an asymptotic approximation.
The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…
In this paper a closed form expression for the number of tilings of an $n\times n$ square border with $1\times 1$ and $2\times1$ cuisenaire rods is proved using a transition matrix approach. This problem is then generalised to $m\times n$…
The study of knot mosaics is based upon representing knot diagrams using a set of tiles on a square grid. This branch of knot theory has many unanswered questions, especially regarding the efficiency with which we draw knots as mosaics.…
This paper studies properties of tilings of the plane by parallelograms. In particular it is established that in parallelogram tilings using a finite number of shapes all tiles occur in only finitely many orientations.
Given the collection of all $m\times n$ rectangular grids which have a fixed number $1\leq r\leq mn$ of blocked cells, we explicitly describe a proper subset of the collection which is guaranteed to contain at least one grid from each…
We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.
Distribution grids represent the final tier in electric networks consisting of medium and low voltage lines that connect the distribution substations to the end-users. Traditionally, distribution networks have been operated in a radial…
Convergence of resource allocation algorithms is well covered in the literature as convergence to a steady state is important due to stability and performance. However, research is lacking when it comes to the propagation of change that…
We solve Poisson's equation using new multigrid algorithms that converge rapidly. The novel feature of the 2D and 3D algorithms are the use of extra diagonal grids in the multigrid hierarchy for a much richer and effective communication…
Let U be a multiply-connected region in R^2 with smooth boundary. Let P_epsilon be a polyomino in epsilon Z^2 approximating U as epsilon tends to 0. We show that, for certain boundary conditions on P_epsilon, the height distribution on a…
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 introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern from a target set, while the second player aims to prevent it.…
This is a chapter in an upcoming book on aperiodic order. We go over different versions of tiling cohomology (\v Cech, pattern-equivariant, PV, quotient) with emphasis on the inverse limit constructions used to compute these cohomologies.…
Given a series of photographs taken during a Go game, we describe the techniques we successfully employ for pinpointing the grid lines of the Go board and for tracking their small movements between consecutive photographs; then we discuss…
The formula for the number of domino tilings due to Kasteleyn and Temperley-Fisher is strikingly similar to Eisenstein's formula for the Legendre symbol. We study the connection between these two concepts and prove a formula which expresses…
We count tilings of a rectangle of integer sides m-1 and n-1 by a special set of tiles. The result is obtained fron the study of the kernel of the adjacency matrix of an n x n rectangular graph of Z x Z.