85 citations · 199 across the 28 of their papers we have counts for
12 papers · 1 filter
Parametrization by Horizontal Constraints in the Study of Algorithmic Properties of -Subshift of Finite Type
Solène J. Esnay, Mathieu Sablik
The non-emptiness, called the Domino Problem, and the characterization of the possible entropies of -subshifts of finite type are standard problems of symbolic dynami…
On the computability properties of topological entropy: a general approach
Silvere Gangloff, Alonso Herrera, Cristobal Rojas +1
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, th…
Simulation of minimal effective dynamical systems on the Cantor sets by minimal tridimensional subshifts of finite type
Silvère Gangloff, Mathieu Sablik
In this text, we prove then that any minimal effective dynamical system on a Cantor set can be simulated by a minimal -SFT, in a sense that…
A characterization of entropy dimensions of minimal tridimensional subshifts of finite type
Silvère Gangloff, Mathieu Sablik
We prove in this text a characterization of the possible entropy dimensions of minimal tridimensional subshifts of finite type with a computability condition, using Goldbach's theo…
Quantified block gluing, aperiodicity and entropy of multidimensional SFT
Silvère Gangloff, Mathieu Sablik
It is possible to define mixing properties for subshifts according to the intensity which allows to concatenate two rectangular blocks. We study the interplay between this intensit…
A generalization of the simulation theorem for semidirect products
Sebastián Barbieri, Mathieu Sablik
We generalize a result of Hochman in two simultaneous directions: Instead of realizing an effectively closed action as a factor of a subaction of a $\mathbb{Z}^{d+2}…