Rigidity and Toeplitz systems

Abstract The aim of this paper is to study measure-theoretical rigidity and partial rigidity for classes of Cantor dynamical systems including Toeplitz systems and enumeration systems. We use Bratteli diagrams to control invariant measures that are produced in our constructions. This leads to systems with desired properties. Among other things, we show that there exists a Toeplitz system with zero entropy that is not partially measure-theoretically rigid with respect to its (unique) invariant measure. We investigate enumeration systems defined by a linear recursion, prove that all such systems are partially rigid and present an example of an enumeration system which is not measure-theoretically rigid. We construct a minimal <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi mathvariant="script">𝒮</m:mi> </m:math> {\mathcal{S}} -adic Toeplitz subshift which has countably infinitely many ergodic invariant probability measures which are rigid for the same rigidity sequence.

Authors

Institutions

Publication Details

Journal
Forum Mathematicum
Published
2025-10-27
DOI
https://doi.org/10.1515/forum-2025-0066
Primary Topic
Mathematical Dynamics and Fractals
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Rigidity and Toeplitz systems

Piotr Oprocha, Henk Bruin, Silvia Radinger, Olena Karpel
Forum Mathematicum
Mathematical Dynamics and Fractals
article

Rigidity and Toeplitz systems

Piotr Oprocha, Henk Bruin, Silvia Radinger, Olena Karpel
article en

Abstract

Abstract The aim of this paper is to study measure-theoretical rigidity and partial rigidity for classes of Cantor dynamical systems including Toeplitz systems and enumeration systems. We use Bratteli diagrams to control invariant measures that are produced in our constructions. This leads to systems with desired properties. Among other things, we show that there exists a Toeplitz system with zero entropy that is not partially measure-theoretically rigid with respect to its (unique) invariant measure. We investigate enumeration systems defined by a linear recursion, prove that all such systems are partially rigid and present an example of an enumeration system which is not measure-theoretically rigid. We construct a minimal <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi mathvariant="script">𝒮</m:mi> </m:math> {\mathcal{S}} -adic Toeplitz subshift which has countably infinitely many ergodic invariant probability measures which are rigid for the same rigidity sequence.

Forum Mathematicum
University of Vienna (AT), University of Ostrava (CZ), AGH University of Krakow (PL)
Openalex Percentile: Top 62%
Mathematical Dynamics and Fractals
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Rigidity and Toeplitz systems — Piotr Oprocha, Henk Bruin, et al. · Forum Mathematicum (2025) | TGRS Research Map | TGRS