Related papers: The Pattern Complexity of the Squiral Tiling
We develop a multifractal random tilling that fills the square. The multifractal is formed by an arrangement of rectangular blocks of different sizes, areas and number of neighbors. The overall feature of the tilling is an heterogeneous and…
Tile the unit square with $n$ small squares. We determine the minimum of the sum of the side lengths of the $n$ small squares, where the minimum is taken over all tilings of the unit square with $n$ squares.
A multicomplex, also known as a twisted chain complex, has an associated spectral sequence via a filtration of its total complex. We give explicit formulas for all the differentials in this spectral sequence.
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…
In this article we study some geometric properties of a non-trivial square tile (a non-trivial square tile is a non-constant function on a square). Consider infinitely many copies of this single square tile and cover the plane with them,…
We show that given any tiling of Euclidean space, any geometric patterns of points, we can find a patch of tiles (of arbitrarily large size) so that copies of this patch appear in the tiling nearly centered on a scaled and translated…
We consider so-called squaring the square-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite…
We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least $\log_2p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some…
We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…
We determine the symmetrized topological complexity of the circle, using primarily just general topology.
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…
We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…
Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 \pi$ each, we set up and parametrize…
We compute the degree complexity of a family of birational mappings of the plane with high order singularities.
As a toy model of chiral interactions in crowded spaces, we consider sphinx tilings in finite regions of the triangular lattice. The sphinx tiles, hexiamonds composed of six equilateral triangles in the shape of a stylized sphinx, come in…
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$…
We find an explicit formula for the generating function for the squaring the terms of an $\ell^{th}$ order linear recurrence.
An h-tiling on a finite simplicial complex is a partition of its geometric realization by maximal simplices deprived of several codimension one faces together with possibly their remaining face of highest codimension. In this last case, the…
As a continuation to our previous work [9, 10], we consider the domino tiling problem with impurities. (1) if we have more than two impurities on the boundary, we can compute the number of corresponding perfect matchings by using the…
We present a construction of the chiral de Rham complex over an algebraic surface with at most rational singularities of $A_n$-type. An explicit formula for the character of the chiral structure sheaf is also provided.