8 citations · 19 across the 11 of their papers we have counts for
8 papers · 1 filter
Topological weak mixing for certain linear involutions of hyperelliptic type
Felipe Arbulú, Bastián Espinoza, Alejandro Maass
A linear involution is an injective piecewise isometry defined on a pair of disjoint intervals. They are defined by a combinatorial data given by a generalized permutation and a le…
Continuous eigenvalues of minimal subshifts via S-adic representations and coboundaries
Valérie Berthé, Paulina Cecchi-Bernales, Bastián Espinoza
We provide characterizations of continuous eigenvalues for minimal symbolic dynamical systems. These characterizations rely on a description of the system in terms of -adic stru…
Eigenvalues and the stabilized automorphism group
Bastián Espinoza, Jennifer N. Jones-Baro
We study the stabilized automorphism group of minimal and, more generally, certain transitive dynamical systems. Our approach involves developing new algebraic tools to extract inf…
The Jacobs--Keane theorem from the $\cS$-adic viewpoint
Felipe Arbulú, Fabien Durand, Bastián Espinoza
In the light of recent developments of the -adic study of subshifts, we revisit, within this framework, a well-known result on Toeplitz subshifts due to Jacobs--Keane…
The structure of low complexity subshifts
Bastián Espinoza
An idea that became unavoidable to study zero entropy symbolic dynamics is that the dynamical properties of a system induce in it a combinatorial structure. An old problem addressi…
On symbolic factors of -adic subshifts of finite topological rank
Bastián Espinoza
This paper studies several aspects of symbolic factors of -adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological…
Symbolic factors of -adic subshifts of finite alphabet rank
Bastián Espinoza
This paper studies several aspects of symbolic ({\em i.e.}\ subshift) factors of -adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20…
On the automorphism group of minimal S-adic subshifts of finite alphabet rank
Bastián Espinoza, Alejandro Maass
It has been recently proved that the automorphism group of a minimal subshift with non-superlinear word complexity is virtually [DDPM15, CK15]. In this article we exte…