Related papers: The exact complexity of a Robinson tiling
The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…
We fix $n$ and say a square in the two-dimensional grid indexed by $(x,y)$ has color $c$ if $x+y \equiv c \pmod{n}$. A {\it ribbon tile} of order $n$ is a connected polyomino containing exactly one square of each color. We show that the set…
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…
A group-theoretical approach to the construction of quasiperiodic tilings of a Euclidean plane, possessing five-fold symmetry, is applied. Of the infinitely many of variants of quasiperiodic partitions of the plane, possessing the dihedral…
An algorithm is provided to tile the plane with the aperiodic monotile Tile(1,1) recently discovered by Smith et al. (2023). Their geometric construction guidelines are expanded into a numerical MATLAB algorithm. The intention is to remove…
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…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
We study here slopes of periodicity of tilings. A tiling is of slope if it is periodic along direction but has no other direction of periodicity. We characterize in this paper the set of slopes we can achieve with tilings, and prove they…
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…
This paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form…
A relatively simple substitution for the Robinson tilings is presented, which requires only 56 tiles up to translation. In this substitution, due to Joan M. Taylor, neighboring tiles are substituted by partially overlapping patches of…
We give an explicit presentation of the module of differentials of order $n$ of a finitely generated algebra via a higher-order Jacobian matrix. We use the presentation to study some aspects of this module in the case of hypersurfaces. More…
Let T be a tile in the Cartesian plane made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be…
We give a method to determine an explicit solution to a system of two inhomogeneous linear recursive sequences of higher order. Our approach can be used efficiently in solving certain combinatorial problems. We finish the paper by…
In the present paper we discuss four ways of looking at rhombile tilings: stacking 3-dimensional cubes, elements of groups, and configurations of lines and points.
We compute the degree complexity of a family of birational mappings of the plane with high order singularities.
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…
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…
The shellability status of previously investigated simplicial complexes with up to 24 facets is settled. In case of shellability the exact number of shellings is determined. Our algorithm merely relies on the facets, and not on additional…
If n is a multiple of 4, then a square of side n can be tiled with T-tetrominos, using a well-known construction. If n is even but not a multiple of four, then there exists an equally well-known construction for tiling a square of side n…