Self-Avoiding Walks on Cayley Graphs Through the Lens of Symbolic Dynamics
We study dynamical and computational properties of the set of bi-infinite self-avoiding walks
on Cayley graphs, as well as ways to compute, approximate and bound their connective …
on Cayley graphs, as well as ways to compute, approximate and bound their connective …
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 …
Snakes can be fooled into thinking they live in a tree
L Bartholdi, V Salo - arXiv preprint arXiv:2409.14525, 2024 - arxiv.org
We construct a finitely generated group which is not virtually free, yet has decidable snake
tiling problem. This shows that either a long-standing conjecture by Ballier and Stein (the …
tiling problem. This shows that either a long-standing conjecture by Ballier and Stein (the …
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 …