1995
DOI: 10.4064/fm-146-2-189-201
|View full text |Cite
|
Sign up to set email alerts
|

Rotation sets for subshifts of finite type

Abstract: For a dynamical system (X, f ) and a function ϕ : X → R N the rotation set is defined. The case when (X, f ) is a transitive subshift of finite type and ϕ depends on the cylinders of length 2 is studied. Then the rotation set is a convex polyhedron. The rotation vectors of periodic points are dense in the rotation set. Every interior point of the rotation set is a rotation vector of an ergodic measure.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
49
0

Year Published

1997
1997
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 45 publications
(49 citation statements)
references
References 0 publications
0
49
0
Order By: Relevance
“…Note that if we use the discrete time (the number of reflections) rather than continuous time, we would get all good properties of the admissible rotation set from the description of the admissible sequences via the graph G and the results of [11]. Since we are using continuous time, the situation is more complicated.…”
Section: Rotation Set -Torusmentioning
confidence: 99%
See 2 more Smart Citations
“…Note that if we use the discrete time (the number of reflections) rather than continuous time, we would get all good properties of the admissible rotation set from the description of the admissible sequences via the graph G and the results of [11]. Since we are using continuous time, the situation is more complicated.…”
Section: Rotation Set -Torusmentioning
confidence: 99%
“…The last statement of the lemma follows from the convexity of the balls in R m . Now we can follow the methods of [8] and [11]. We assume that our billiard has a small obstacle.…”
Section: Rotation Set -Torusmentioning
confidence: 99%
See 1 more Smart Citation
“…When X is a subshift of finite type, a theorem of Ziemian [17] states that ρ(X) is a convex set with finitely many extreme points, given by the rotation vectors of the minimal loops of the transition diagram. While this result is useful, subshifts of finite type are rather special, and are often ill-suited to understand dynamical behaviour in parameterised families, since Markov partitions can change dramatically under small changes in the map.…”
Section: Introductionmentioning
confidence: 99%
“…For higher dimensional spectra the situation is more complicated, in part, since concave and upper semi-continuous functions may have in theory discontinuities at the boundary of the domain unless the domain is polyhedral [6]. We note that the case R L (f ) being a polyhedron occurs for example if f is piecewise linear [14], in which case H f is continuous on R L (f ). In this paper we show that the entropy spectrum may be discontinuous even when the polyhedron property fails only at one point.…”
mentioning
confidence: 99%