相关论文: Experimental Results on Potential Markov Partition…

We define a partition $\mathcal{P}_0$ and a $\mathbb{Z}^2$-rotation ($\mathbb{Z}^2$-action defined by rotations) on a 2-dimensional torus whose associated symbolic dynamical system is a minimal proper subshift of the Jeandel-Rao aperiodic…

Jeandel and Rao proved that 11 is the size of the smallest set of Wang tiles, i.e., unit squares with colored edges, that admit valid tilings (contiguous edges of adjacent tiles have the same color) of the plane, none of them being…

We consider a new family $(\mathcal{T}_n)_{n\geq1}$ of aperiodic sets of Wang tiles and we describe the dynamical properties of the set $\Omega_n$ of valid configurations $\mathbb{Z}^2\to\mathcal{T}_n$. The tiles can be defined as the…

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.…

Wang tiles enable efficient pattern compression while avoiding the periodicity in tile distribution via programmable matching rules. However, most research in Wang tilings has considered tiling the infinite plane. Motivated by emerging…

The paper presents a concept/technique to compress and synthesize complex material morphologies that is based on Wang tilings. Specifically, a microstructure is stored in a set of Wang tiles and its reconstruction is performed by means of a…

Microstructural geometry plays a critical role in the response of heterogeneous materials. Consequently, methods for generating microstructural samples are increasingly crucial to advanced numerical analyses. We extend Sonon et al.'s…

We introduce a partial decidability protocol for the Wang tiling problem (which is the prototype of undecidable problems in combinatorics and statistical physics) by constructing a suitable mapping from tilings of finite squares of…

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…

We give a constructive method that can decrease the number of prototiles needed to tile a space. We achieve this by exchanging edge to edge matching rules for a small atlas of permitted patches. This method is illustrated with Wang tiles,…

We define a Wang tile set $\mathcal{U}$ of cardinality 19 and show that the set $\Omega_\mathcal{U}$ of all valid Wang tilings $\mathbb{Z}^2\to\mathcal{U}$ is self-similar, aperiodic and is a minimal subshift of…

This paper describes a recomposition of the rhombic Penrose aperiodic protoset due to Robert Ammann. We show that the three prototiles that result from the recomposition form an aperiodic protoset in their own right without adjacency rules.…

We introduce the idea that the P vs NP problem can have a finer structure. Given the NP complete problem of interest, the configurations space of the problem can be divided in (at least) two regions. In one region, polynomial algorithms to…

The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand,…

Motivated by the study of Fibonacci-like Wang shifts, we define a numeration system for $\mathbb{Z}$ and $\mathbb{Z}^2$ based on the binary alphabet $\{0,1\}$. We introduce a set of 16 Wang tiles that admits a valid tiling of the plane…

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…

This paper presents an approach to constructing microstructural enrichment functions to local fields in non-periodic heterogeneous materials with applications in Partition of Unity and Hybrid Finite Element schemes. It is based on a concept…

We present aperiodic sets of prototiles whose shapes are based on the well-known Penrose rhomb tiling. Some decorated prototiles lead to an exact Penrose rhomb tiling without any matching rules. We also give an approximate solution to an…

We study $k$-divisible partition structures, which are families of random set partitions whose block sizes are divisible by an integer $k=1,2,\ldots$. In this setting, exchangeability corresponds to the usual invariance under relabeling by…

One of the most fundamental problems in tiling theory is the domino problem: given a set of tiles and tiling rules, decide if there exists a way to tile the plane using copies of tiles and following their rules. The problem is known to be…