Related papers: Computability and Tiling Problems
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
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 investigate the topological aspects of some algebraic computation models, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and computability in the sense of computable analysis can be. The…
In the 60's, Berger famously showed that translational tilings of $\mathbb{Z}^2$ with multiple tiles are algorithmically undecidable. Recently, Bhattacharya proved the decidability of translational monotilings (tilings by translations of a…
The Turing machine, as it was presented by Turing himself, models the calculations done by a person. This means that we can compute whatever any Turing machine can compute, and therefore we are Turing complete. The question addressed here…
We extend the classical Domino problem to any tiling of rhombus-shaped tiles. For any subshift X of edge-to-edge rhombus tilings, such as the Penrose subshift, we prove that the associated X-Domino problem is $\Pi^0_1$ -hard and therefore…
In this paper we treat the $\tau$-tilting finiteness of biserial (respectively special biserial) algebras over algebraically closed (respectively arbitrary) fields. Inside these families, to compare the notions of representation-finiteness…
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite "tensorial dimension". Such vector spaces with a finite tensorial dimension permit to…
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…
We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…
This is a review (in Italian) on aperiodic tilings of the plane intended for a general audience. First, we recall some basic results about lattices and periodic tilings. Then, we move on to one-dimensional (domino) tilings and Wang tilings.…
Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian…
We consider the problem of characterizing finite sets which tile the integers by translations. Coven and Meyerowitz (J. Algebra 1999) found necessary and sufficient conditions for a finite set A to tile the integers under the assumption…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
We introduce a fractal version of the pinwheel substitution tiling. There are thirteen basic prototiles, all of which have fractal boundaries. These tiles, along with their reflections and rotations, create a tiling space which is mutually…
Let $A$ be an expanding matrix on ${\Bbb R}^s$ with integral entries. A fundamental question in the fractal tiling theory is to understand the structure of the digit set ${\mathcal D}\subset{\Bbb Z}^s$ so that the integral self-affine set…
The interplay between supersymmetry and classical and quantum computation is discussed. First, it is shown that the problem of computing the Witten index of $\mathcal N \leq 2$ quantum mechanical systems is $\#P$-complete and therefore…
The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…
We study the constructible Witt theory of \'etale sheaves of $\Lambda$-modules on a scheme $X$ for coefficient rings $\Lambda$ having finite characteristic not equal to 2 and prime to the residue characteristics of the scheme $X$. Our…
For a (non-unit) Pisot number $\beta$, several collections of tiles are associated with $\beta$-numeration. This includes an aperiodic and a periodic one made of Rauzy fractals, a periodic one induced by the natural extension of the…