scholarly journals On the Perron root and eigenvectors associated with a subshift of finite type

2021 ◽  
Author(s):  
Haritha Cheriyath ◽  
Nikita Agarwal
Keyword(s):  
Finite Type ◽  
Subshift Of Finite Type ◽  
Perron Root

SPECTRA OF RECURRENCE DIMENSION FOR ADIC SYSTEMS

2002 ◽  
Vol 02 (04) ◽  
pp. 599-607 ◽  
Author(s):  
VÍCTOR F. SIRVENT
Keyword(s):  
Finite Type ◽  
Subshift Of Finite Type ◽  
Poincare Recurrence ◽  
Definition Of ◽  
Poincaré Recurrence

We compute the spectra of the recurrence dimension for adic systems and sub-adic systems. This dimension is characterized by the Poincaré recurrence of the system, and known in the literature as Afraimovich–Pesin dimension. These spectra are invariant under bi-Lipschitz transformations. We show that there is a duality between the spectra of an adic system and the corresponding subshift of finite type. We also consider Billingsley-like definition of the spectra of the recurrence dimension.

Recurrence in pairs

2008 ◽  
Vol 28 (4) ◽  
pp. 1135-1143 ◽  
Author(s):  
KAMEL HADDAD ◽  
WILLIAM OTT
Keyword(s):  
Finite Number ◽  
Finite Type ◽  
Sufficient Conditions ◽  
Dense Orbit ◽  
Subshift Of Finite Type

AbstractWe introduce and study the notion of weak product recurrence. Two sufficient conditions for this type of recurrence are established. We deduce that any point with a dense orbit in either the full one-sided shift on a finite number of symbols or a mixing subshift of finite type is weakly product recurrent. This observation implies that distality does not follow from weak product recurrence. We have therefore answered, in the negative, a question posed by Auslander and Furstenberg.

Prevalence of rapid mixing in hyperbolic flows

1998 ◽  
Vol 18 (5) ◽  
pp. 1097-1114 ◽  
Author(s):  
DMITRY DOLGOPYAT
Keyword(s):  
Finite Type ◽  
Periodic Orbits ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Suspension Flow ◽  
Subshift Of Finite Type ◽  
Rapid Mixing ◽  
Hyperbolic Flows ◽  
Necessary And Sufficient

We provide necessary and sufficient conditions for a suspension flow, over a subshift of finite type, to mix faster than any power of time. Then we show that these conditions are satisfied if the flow has two periodic orbits such that the ratio of the periods cannot be well approximated by rationals.

Languages, equicontinuity and attractors in cellular automata

1997 ◽  
Vol 17 (2) ◽  
pp. 417-433 ◽  
Author(s):  
PETR KŮRKA
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
State Space ◽  
Finite Type ◽  
Measure Zero ◽  
Initial Conditions ◽  
The State ◽  
Subshift Of Finite Type ◽  
Topologically Transitive ◽  
The Third

We consider three related classifications of cellular automata: the first is based on the complexity of languages generated by clopen partitions of the state space, i.e. on the complexity of the factor subshifts; the second is based on the concept of equicontinuity and it is a modification of the classification introduced by Gilman [9]. The third one is based on the concept of attractors and it refines the classification introduced by Hurley [16]. We show relations between these classifications and give examples of cellular automata in the intersection classes. In particular, we show that every positively expansive cellular automaton is conjugate to a one-sided subshift of finite type and that every topologically transitive cellular automaton is sensitive to initial conditions. We also construct a cellular automaton with minimal quasi-attractor, whose basin has measure zero, answering a question raised in Hurley [16].

Conditions for topologically semi-conjugacy of the induced systems to the subshift of finite type

2017 ◽  
Vol 98 ◽  
pp. 1-6 ◽  
Author(s):  
Hyonhui Ju ◽  
Cholsan Kim ◽  
Yunmi Choe ◽  
Minghao Chen
Keyword(s):  
Finite Type ◽  
Subshift Of Finite Type

scholarly journals FINITELY CONSTRAINED GROUPS OF MAXIMAL HAUSDORFF DIMENSION

2015 ◽  
Vol 100 (1) ◽  
pp. 108-123 ◽  
Author(s):  
ANDREW PENLAND ◽  
ZORAN ŠUNIĆ
Keyword(s):  
Hausdorff Dimension ◽  
Finite Type ◽  
Binary Tree ◽  
Rooted Tree ◽  
Finitely Generated ◽  
Subshift Of Finite Type ◽  
Regular Tree ◽  
Pattern Size ◽  
Tree Automorphisms ◽  
Pattern Group

We prove that if $G_{P}$ is a finitely constrained group of binary rooted tree automorphisms (a group binary tree subshift of finite type) defined by an essential pattern group $P$ of pattern size $d$, $d\geq 2$, and if $G_{P}$ has maximal Hausdorff dimension (equal to $1-1/2^{d-1}$), then $G_{P}$ is not topologically finitely generated. We describe precisely all essential pattern groups $P$ that yield finitely constrained groups with maximal Hausdorff dimension. For a given size $d$, $d\geq 2$, there are exactly $2^{d-1}$ such pattern groups and they are all maximal in the group of automorphisms of the finite rooted regular tree of depth $d$.

scholarly journals Automorphisms of one-sided subshifts of finite type

1990 ◽  
Vol 10 (3) ◽  
pp. 421-449 ◽  
Author(s):  
Mike Boyle ◽  
John Franks ◽  
Bruce Kitchens
Keyword(s):  
Automorphism Group ◽  
Finite Type ◽  
Finite Order ◽  
Subshift Of Finite Type ◽  
Finite Subgroups ◽  
Subshifts Of Finite Type

AbstractWe prove that the automorphism group of a one-sided subshift of finite type is generated by elements of finite order. For one-sided full shifts we characterize the finite subgroups of the automorphism group. For one-sided subshifts of finite type we show that there are strong restrictions on the finite subgroups of the automorphism group.

Sign in / Sign up

Export Citation Format

Share Document