Soficity of free extensions of effective subshifts
S Barbieri, M Sablik, V Salo - arXiv preprint arXiv:2309.02620, 2023 - arxiv.org
Let $ G $ be a group and $ H\leqslant G $ a subgroup. The free extension of an $ H $-
subshift $ X $ to $ G $ is the $ G $-subshift $\widetilde {X} $ whose configurations are those …
subshift $ X $ to $ G $ is the $ G $-subshift $\widetilde {X} $ whose configurations are those …
Undecidability of dynamical properties of SFTs and sofic subshifts on and other groups
N Carrasco-Vargas - arXiv preprint arXiv:2401.10347, 2024 - arxiv.org
We study the algorithmic undecidability of abstract dynamical properties for sofic $\mathbb
{Z}^{2} $-subshifts and subshifts of finite type (SFTs) on $\mathbb {Z}^{2} $. Within the class …
{Z}^{2} $-subshifts and subshifts of finite type (SFTs) on $\mathbb {Z}^{2} $. Within the class …
Realizability of Subgroups by Subshifts of Finite Type
N Bitar - arXiv preprint arXiv:2406.04132, 2024 - arxiv.org
We study the problem of realizing families of subgroups as the set of stabilizers of
configurations from a subshift of finite type (SFT). This problem generalizes both the …
configurations from a subshift of finite type (SFT). This problem generalizes both the …
Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability
N Bitar - arXiv preprint arXiv:2312.08911, 2023 - arxiv.org
We study the seeded domino problem, the recurring domino problem and the $ k $-SAT
problem on finitely generated groups. These problems are generalization of their original …
problem on finitely generated groups. These problems are generalization of their original …
Tilings of the hyperbolic plane of substitutive origin as subshifts of finite type on Baumslag–Solitar groups
N Aubrun, M Schraudner - Comptes …, 2024 - comptes-rendus.academie-sciences …
We present a technique to lift some tilings of the discrete hyperbolic plane–tilings defined by
a 1D substitution–into a zero entropy subshift of finite type (SFT) on non-abelian amenable …
a 1D substitution–into a zero entropy subshift of finite type (SFT) on non-abelian amenable …
Algorithmique et combinatoire des mots par les représentations S-adiques
P Béaur - 2024 - theses.hal.science
En combinatoire des mots, une méthode classique de construction de mots infinis est le
modèle substitutif. Il consiste à itérer infiniment une transformation (une substitution) sur une …
modèle substitutif. Il consiste à itérer infiniment une transformation (une substitution) sur une …
[引用][C] Subshifts on groups and computable analysis
N Carrasco Vargas - 2024 - Ben Gurion University of the Negev