85 citations · 199 across the 28 of their papers we have counts for
28 papers
Characterisation of the Set of Ground States of Uniformly Chaotic Finite-Range Lattice Models
Léo Gayral, Léopoldine Gayral, Mathieu Sablik +1
Chaotic dependence on temperature refers to the phenomenon of divergence of Gibbs measures as the temperature approaches a certain value. Models with chaotic behaviour near zero te…
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings
Léo Gayral, Léopoldine Gayral, Mathieu Sablik
The purpose of this article is to study the algorithmic complexity of the Besicovitch stability of noisy subshifts of finite type, a notion studied in a previous article. First, we…
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…
Self-simulable groups
Sebastián Barbieri, Mathieu Sablik, Ville Salo
We say that a finitely generated group is self-simulable if every effectively closed action of on a closed subset of is the topolog…
On entropies of block-gluing subshifts
Svetlana Puzynina, Mathieu Sablik
A subshift is called -block gluing if for any integer and any two blocks and from the language of there exists an element of which has occurrences…
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…