Hostname: page-component-89b8bd64d-nlwjb Total loading time: 0 Render date: 2026-05-08T01:09:11.211Z Has data issue: false hasContentIssue false

On partial rigidity of $\mathcal {S}$-adic subshifts

Published online by Cambridge University Press:  24 February 2025

SEBASTIÁN DONOSO
Affiliation:
Departamento de Ingeniería Matemática and Centro de Modelamiento Matemático, Universidad de Chile and IRL-CNRS 2807, Beauchef 851, Santiago, Chile (e-mail: sdonoso@dim.uchile.cl)
ALEJANDRO MAASS
Affiliation:
Departamento de Ingeniería Matemática, Centro de Modelamiento Matemático and Millennium Institute Center for Genome Regulation, Santiago, Chile Universidad de Chile and IRL-CNRS 2807, Beauchef 851, Santiago, Chile (e-mail: amaass@dim.uchile.cl)
TRISTÁN RADIĆ*
Affiliation:
Departamento de Ingeniería Matemática, Universidad de Chile, Beauchef 851, Santiago, Chile Department of Mathematics, Northwestern University, 2033 Sheridan Road, Evanston, IL, USA
Rights & Permissions [Opens in a new window]

Abstract

We develop combinatorial tools to study partial rigidity within the class of minimal $\mathcal {S}$-adic subshifts. By leveraging the combinatorial data of well-chosen Kakutani–Rokhlin partitions, we establish a necessary and sufficient condition for partial rigidity. Additionally, we provide an explicit expression to compute the partial rigidity rate and an associated partial rigidity sequence. As applications, we compute the partial rigidity rate for a variety of constant length substitution subshifts, such as the Thue–Morse subshift, where we determine a partial rigidity rate of 2/3. We also exhibit non-rigid substitution subshifts with partial rigidity rates arbitrarily close to 1 and, as a consequence, using products of the aforementioned substitutions, we obtain that any number in $[0, 1]$ is the partial rigidity rate of a system.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press