Related papers: Simultaneous tiling
We introduce a notion of equivalence on tilings which is formulated in terms of their local structure. We compare it with the known concept of locally deriving one tiling from another and show that two tilings of finite type are…
The purpose of this paper is to give the flavor of the subject of self-similar tilings in a relatively elementary setting, and to provide a novel method for the construction of such polygonal tilings.
Partitioning large matrices is an important problem in distributed linear algebra computing (used in ML among others). Briefly, our goal is to perform a sequence of matrix algebra operations in a distributed manner (whenever possible) on…
Computations, where the number of results is much smaller than the input data and are produced through some sort of accumulation, are called Reductions. Reductions appear in many scientific applications. Usually, reductions admit an…
This paper proves the following statement: {\it If a convex body can form a twofold translative tiling in $\mathbb{E}^3$, it must be a parallelohedron.} In other words, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron,…
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
One of the best things about geometry is that it's cool! Geometry enables us to create incredible designs and astounding patterns. This article shows how to use a simple technique (iteration) to create designs that are both cool and…
We define a kind of moduli space of nested surfaces and mappings, which we call a comparison moduli space. We review examples of such spaces in geometric function theory and modern Teichmueller theory, and illustrate how a wide range of…
We describe a method to classify crystallographic tilings of the Euclidean and hyperbolic planes by tiles whose stabiliser group contains translation isometries or whose topology is not that of a closed disk. We tackle this problem from two…
We construct an example of a group $G = \mathbb{Z}^2 \times G_0$ for a finite abelian group $G_0$, a subset $E$ of $G_0$, and two finite subsets $F_1,F_2$ of $G$, such that it is undecidable in ZFC whether $\mathbb{Z}^2\times E$ can be…
This study explores the properties of the function which can tile the field $\mathbb{Q}_p$ of $p$-adic numbers by translation. It is established that functions capable of tiling $\mathbb{Q}_p$ is by translation uniformly locally constancy.…
We compute the Cech cohomology with integer coefficients of one-dimensional tiling spaces arising from not just one, but several different substitutions, all acting on the same set of tiles. These calculations involve the introduction of a…
In this informal expository note, we quickly introduce and survey compactifications of strata of holomorphic 1-forms on Riemann surfaces, i.e. spaces of translation surfaces. In the last decade, several of these have been constructed,…
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…
We study the properties of tilting modules in the context of properly stratified algebras. In particular, we answer the question when the Ringel dual of a properly stratified algebra is properly stratified itself, and show that the class of…
Delaunay Triangulation(DT) is one of the important geometric problems that is used in various branches of knowledge such as computer vision, terrain modeling, spatial clustering and networking. Kinetic data structures have become very…
Every body knows that identical regular triangles or squares can tile the whole plane. Many people know that identical regular hexagons can tile the plane properly as well. In fact, even the bees know and use this fact! Is there any other…
We wish to tile a rectangle or a torus with only vertical and horizontal bars of a given length, such that the number of bars in every column and row equals given numbers. We present results for particular instances and for a more general…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. One extreme of the finite problem is single tile tilings. We develop the algorithm for finding all the single tile tilings and present the…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…