Related papers: Fusion tilings with infinite local complexity
The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of…
To understand an aperiodic tiling (or a quasicrystal modeled on an aperiodic tiling), we construct a space of similar tilings, on which the group of translations acts naturally. This space is then an (abstract) dynamical system. Dynamical…
We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of…
We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…
In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types…
Periodic tilings play a role in the decorative arts, in construction and in crystal structures. Combinatorial tiling theory allows the systematic generation, visualization and exploration of such tilings of the plane, sphere and hyperbolic…
Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…
Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal…
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
We study the complexity of locally checkable labeling (LCL) problems on $\mathbb{Z}^n$ from the point of view of descriptive set theory, computability theory, and factors of i.i.d. Our results separate various complexity classes that were…
The local structure of a tiling is described in terms of a multiplicative structure on its pattern classes. The groupoid associated to the tiling is derived from this structure and its integer group of coinvariants is defined. This group…
We show that silting modules are closely related with localisations of rings. More precisely, every partial silting module gives rise to a localisation at a set of maps between countably generated projective modules and, conversely, every…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…
We define a new class of completions of locally symmetric varieties of type IV which interpolates between the Baily-Borel compactification and Mumford's toric compactifications. An arithmetic arrangement in a locally symmetric variety of…
In this short note, we merge the areas of hypercomplex algebras with that of fractal interpolation and approximation. The outcome is a new holistic methodology that allows the modelling of phenomena exhibiting a complex self-referential…
We prove that is a measurable domain tiles R or R^2 by translations, and if it is "close enough" to a line segment or a square respectively, then it admits a lattice tiling. We also prove a similar result for spectral sets in dimension 1,…
Inspired by the modelization of 2D materials systems, we characterize arrangements of identical nonflat squares in 3D. We prove that the fine geometry of such arrangements is completely characterized in terms of patterns of mutual…
A self-affine tiling of a compact set G of positive Lebesgue measure is its partition to parallel shifts of a compact set which is affinely similar to G. We find all polyhedral sets (unions of finitely many convex polyhedra) that admit…
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.
This thesis establishes a generalised setting with which to unify the study of finite local complexity (FLC) patterns. The abstract notion of a "pattern" is introduced, which may be seen as an analogue of the space group of isometries…