相关论文: Spatial chaos of Wang tiles with two symbols

This investigation studies the decidability problem of plane edge coloring with three symbols. In the edge coloring (or Wang tiles) of a plane, unit squares with colored edges that have one of $p$ colors are arranged side by side such that…

We present a new aperiodic tileset containing 11 Wang tiles on 4 colors, and we show that this tileset is minimal, in the sense that no Wang set with either fewer than 11 tiles or fewer than 4 colors is aperiodic. This gives a definitive…

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…

For every positive integer $n$, we introduce a set $\mathcal{T}_n$ made of $(n+3)^2$ Wang tiles (unit squares with labeled edges). We represent a tiling by translates of these tiles as a configuration $\mathbb{Z}^2\to\mathcal{T}_n$. A…

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

In this article, we apply the techniques developed in our previous article ``Local generation of tilings'', in which we introduced two definitions capturing the intuitive idea that some subshifts admit a procedure that can generate any…

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…

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…

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 extent of the continuous zone of chaotic orbits of a small-mass tertiary around a system of two gravitationally bound primaries (a double star, a double black hole, a binary asteroid, etc.) is estimated analytically, in function of the…

We have investigated the "weak chaos" exponent to see if it can be considered as a classification parameter of different sandpile models. Simulation results show that "weak chaos" exponent may be one of the characteristic exponents of the…

We study the chaos of travelling waves (TW) in unidirectional chains of bistable maps. Previous numerical results suggested that this property is selective, {\sl viz.}\ given the parameters, there is at most a single (non-trivial) velocity…

We examine the conjecture that entropy production in subsystems of a given system can be used as a dynamical criterion for quantum chaos in the latter. Numerical results are presented for finite dimensional spin systems as also for the…

We discuss Devaney chaos on compact metric spaces using a decomposition space characterized by topological nature of symbolic dynamics. A chaotic map obtained here is defined as a topologically conjugate of the chaotic map on a…

Positive topological entropy and distributional chaos are characterized for hereditary shifts. A hereditary shift has positive topological entropy if and only if it is DC2-chaotic (or equivalently, DC3-chaotic) if and only if it is not…

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…

It is shown that a coupled map model for open flow may exhibit spatial chaos and spatial quasiperiodicity with temporal periodicity. The locations of these patterns, which cover a substantial part of parameter space, are indicated in a…

Quantum chaos is presented as a paradigm of information processing by dynamical systems at the bottom of the range of phase-space scales. Starting with a brief review of classical chaos as entropy flow from micro- to macro-scales, I argue…

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…

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…