Related papers: Structural aspects of tilings

Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…

Let $X$ be a measure space with a measure-preserving action $(g,x) \mapsto g \cdot x$ of an abelian group $G$. We consider the problem of understanding the structure of measurable tilings $F \odot A = X$ of $X$ by a measurable tile $A…

Statistical Topology emerged since topological aspects continue to gain importance in many areas of physics. It is most desirable to study topological invariants and their statistics in schematic models that facilitate the identification of…

This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…

A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The…

We introduce the notion of an ordered face structure. The ordered face structures to many-to-one computads are like positive face structures to positive-to-one computads. This allow us to give an explicit combinatorial description of…

We present a survey of results concerning the use of inductive constructions to study the rigidity of frameworks. By inductive constructions we mean simple graph moves which can be shown to preserve the rigidity of the corresponding…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

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…

Tiling models are classical statistical models in which different geometric shapes, the tiles, are packed together such that they cover space completely. In this paper we discuss a class of two-dimensional tiling models in which the tiles…

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

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…

This paper studies tilings related to the beta-transformation when beta is a Pisot number (that is not supposed to be a unit). Then it applies the obtained results to study the set of rational numbers having a purely periodic…

We study dualities between classes of relational topological structures, given by Hom-functors. We show that there exists a 2-element structure with infinitely many relations, which reconstructs all other structures generated by a 2-element…

We consider two families of planar self-similar tilings of different nature: the tilings consisting of translated copies of the fractal sets defined by an iterated function system, and the tilings obtained as a geometrical realization of a…

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…

We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of…

The problem of Turing pattern formation has attracted much attention in nonlinear science as well as physics, chemistry and biology. So far all Turing patterns have been observed in stationary and oscillatory media only. In this letter we…