相关论文: Undecidable translational tilings with only two ti…
Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets. We prove however that the…
In this piece, we examine one variant of the infamous 15 Tile Puzzle and develop a mathematical backing behind why it is unsolvable. Using concepts of permutations, bijectivity, and cycle transpositions, we not only prove how to model this…
A simple, yet unifying method is provided for the construction of tilings by tiles obtained from the attractor of an iterated function system (IFS). Many examples appearing in the literature in ad hoc ways, as well as new examples, can be…
We present here an elementary construction of an aperiodic tile set. Although there already exist dozens of examples of aperiodic tile sets we believe this construction introduces an approach that is different enough to be interesting and…
We develop a general framework of Euclidean patterns and pattern spaces of translational finite local complexity (FLC), analogues of translational tiling spaces. The notion of a self affine substitution of tilings is extended to both…
We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…
We present a single, connected tile which can tile the plane but only non-periodically. The tile is hexagonal with edge markings, which impose simple rules as to how adjacent tiles are allowed to meet across edges. The first of these rules…
A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For…
We introduce a new type of aperiodic hexagonal monotile; a prototile that admits infinitely many tilings of the plane, but any such tiling lacks any translational symmetry. Adding a copy of our monotile to a patch of tiles must satisfy two…
The abelian sandpile models feature a finite abelian group $G$ generated by the operators corresponding to particle addition at various sites. We study the canonical decomposition of $G$ as a product of cyclic groups $G = Z_{d_1} \times…
Can the entire plane be paved with a single tile that forces aperiodicity? This is known as the ein Stein problem (in German, ein Stein means one tile). This paper presents an aperiodic monotile for the tiler. It is based on the monotile…
All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…
We define a new family of non-periodic tilings with square tiles that is mutually locally derivable with some family of tilings with isosceles right triangles. Both families are defined by simple local rules, and the proof of their…
Non-periodic tilings with Tile(1, 1) using the substitution method, as presented by Smith et al. in [2] and [3], can be converted into non-periodic tilings with three types of pentagons. When arbitrary replacements are excluded, the…
First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…
Classical results on aperiodic tilings are rather complicated and not widely understood. Below, an alternative approach is discussed in hope to provide additional intuition not apparent in classical works.
We prove that acylindrically hyperbolic groups are monotileable. That is, every finite subset of the group is contained in a finite tile. This provides many new examples of monotileable groups, and progress on the question of whether every…
In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…