Dimension groups and recurrence for tree subshifts
Apparaît également dans la collection : Jean-Morlet chair: Tiling and recurrence / Chaire Jean-Morlet : Pavages et récurrence
Dimension groups are invariants of orbital equivalence. We show in this lecture how to compute the dimension group of tree subshifts. Tree subshifts are defined in terms of extension graphs that describe the left and right extensions of factors of their languages: the extension graphs are trees. This class of subshifts includes classical families such as Sturmian, Arnoux-Rauzy subshifts, or else, codings of interval exchanges. We rely on return word properties for tree subshifts: every finite word in the language of a tree word admits exactly d return words, where d is the cardinality of the alphabet. This is joint work with P. Cecchi, F. Dolce, F. Durand, J. Leroy, D. Perrin, S. Petite.
![$k$-sum free sets in $[0,1]$](/media/cache/video_light/uploads/video/2015-09-10_de_Roton-video--19cf70874d3c5af7378c268cab865b06.jpg)
