Computability of extender sets in multidimensional subshifts - GREYC amacc Access content directly
Preprints, Working Papers, ... Year : 2024

Computability of extender sets in multidimensional subshifts


Subshifts are colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. Given a subshift and a finite pattern, its extender set is the set of admissible completions of this pattern. It has been conjectured that the behavior of extender sets, and in particular their growth called extender entropy (see [2019, French and Pavlov]),could provide a way to separate the classes of sofic and effective subshifts. We prove here that both classes have the same possible extender entropies: exactly the $\Pi_3$ real numbers of $[0,+\infty)$. We also consider computational properties of extender entropies for subshifts with some language or dynamical properties: computable language, minimal and some mixing properties.
Fichier principal
Vignette du fichier
extender-entropy.pdf (758.82 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04390697 , version 1 (12-01-2024)


  • HAL Id : hal-04390697 , version 1


Antonin Callard, Léo Paviet Salomon, Pascal Vanier. Computability of extender sets in multidimensional subshifts. 2024. ⟨hal-04390697⟩
70 View
13 Download


Gmail Mastodon Facebook X LinkedIn More