Block Maps between Primitive Uniform and Pisot Substitutions
Abstract: We prove that for all pairs of primitive Pisot or uniform substitutions with the same dominating eigenvalue, there exists a finite set of block maps such that every block map between the corresponding subshifts is an element of this set, up to a shift. This result is proved using a common generalization of block maps and substitutions, which we call dill maps.
Read MorePlaying with Subshifts
Abstract: We study the class of word-building games, where two players pick letters from afinite alphabet to construct a finite or infinite word. The outcome is determined by whether the resulting word lies in a prescribed set (a win for player A) or not (a win for player B). We focus on symbolic dynamical games, where the target set is a subshift. We investigate the relation between the target subshift and the set of turn orders for which A has a winning strategy.
Read MoreAn almost-additive ergodic theorem on amenable groups & Fiber-mixing codes and factors of Gibbs measures for subshifts of finite type
Read MoreHeisenberg Odometers: Structure and Spectra.
Sala de Seminarios 6to piso. Avda. Blanco Encalada 2120
Read More



Noticias en español
