اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديد$S$-adic conjecture and Bratteli diagrams
174
0
0.0
(
0
)
تأليف
Fabien Durand
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this note we apply a substantial improvement of a result of S. Ferenczi on $S$-adic subshifts to give Bratteli-Vershik representations of these subshifts.
قيم البحث
اقرأ أيضاً
This article discusses the life and work of Professor Ola Bratteli (1946--2015). Family, fellow students, his advisor, colleagues and coworkers review aspects of his life and his outstanding mathematical accomplishments.
Dimension groups are complete invariants of strong orbit equivalence for minimal Cantor systems. This paper studies a natural family of minimal Cantor systems having a finitely generated dimension group, namely the primitive unimodular proper S-adic
subshifts. They are generated by iterating sequences of substitutions. Proper substitutions are such that the images of letters start with a same letter, and similarly end with a same letter. This family includes various classes of subshifts such as Brun subshifts or dendric subshifts, that in turn include Arnoux-Rauzy subshifts and natural coding of interval exchange transformations. We compute their dimension group and investigate the relation between the triviality of the infinitesimal subgroup and rational independence of letter measures. We also introduce the notion of balanced functions and provide a topological characterization of bal-ancedness for primitive unimodular proper S-adic subshifts.
The $S$-adic conjecture claims that there exists a condition $C$ such that a sequence has a sub-linear complexity if and only if it is an $S$-adic sequence satisfying Condition $C$ for some finite set $S$ of morphisms. We present an overview of the f
actor complexity of $S$-adic sequences and we give some examples that either illustrate some interesting properties or that are counter-examples to what could be believed to be a good Condition $C$.
In this article we study conditions to be a continuous or a measurable eigenvalue of finite rank minimal Cantor systems, that is, systems given by an ordered Bratteli diagram with a bounded number of vertices per level. We prove that continuous eigen
values always come from the stable subspace associated to the incidence matrices of the Bratteli diagram and we study rationally independent generators of the additive group of continuous eigenvalues. Given an ergodic probability measure, we provide a general necessary condition to be a measurable eigenvalue. Then we consider two families of examples. A first one to illustrate that measurable eigenvalues do not need to come from the stable space. Finally we study Toeplitz type Cantor minimal systems of finite rank. We recover classical results in the continuous case and we prove measurable eigenvalues are always rational but not necessarily continuous.
Minimal Cantor systems of finite topological rank (that can be represented by a Bratteli-Vershik diagram with a uniformly bounded number of vertices per level) are known to have dynamical rigidity properties. We establish that such systems, when they
are expansive, define the same class of systems, up to topological conjugacy, as primitive and recognizable ${mathcal S}$-adic subshifts. This is done establishing necessary and sufficient conditions for a minimal subshift to be of finite topological rank. As an application, we show that minimal subshifts with non-superlinear complexity (like all classical zero entropy examples) have finite topological rank. Conversely, we analyze the complexity of ${mathcal S}$-adic subshifts and provide sufficient conditions for a finite topological rank subshift to have a non-superlinear complexity. This includes minimal Cantor systems given by Bratteli-Vershik representations whose tower levels have proportional heights and the so called left to right ${mathcal S}$-adic subshifts. We also exhibit that finite topological rank does not imply non-superlinear complexity. In the particular case of topological rank 2 subshifts, we prove their complexity is always subquadratic along a subsequence and their automorphism group is trivial.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
