- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- On least period sets of finitely presented dynamical...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
On least period sets of finitely presented dynamical systems de Jong, Huub
Abstract
We classify the set of natural numbers n for which certain subclasses of dynamical systems (X,f) on a compact metric space X have a periodic point of least period n. Interest in this question dates back to Sharkovskii's theorem for continuous maps on intervals of the real line, but it also ties to checkable conditions for Krieger's embedding theorem for symbolic dynamical systems. We begin by showing that while the Artin-Mazur zeta function of the system in principle contains this information entirely, it appears that extracting this information directly is far from trivial. If our system has a rational zeta function, we can classify for which n we have a periodic point of (not necessarily least) period n, by using the highly intricate Skolem-Mahler-Lech theorem. Moreover, we build on deep work on finitely presented (FP) systems and their relationship to symbolic dynamics to classify the set of least periods for arbitrary FP systems, and shifts of finite type. We also provide several constructions to realize any such least period sets.
Item Metadata
Title |
On least period sets of finitely presented dynamical systems
|
Creator | |
Supervisor | |
Publisher |
University of British Columbia
|
Date Issued |
2025
|
Description |
We classify the set of natural numbers n for which certain subclasses of dynamical systems (X,f) on a compact metric space X have a periodic point of least period n. Interest in this question dates back to Sharkovskii's theorem for continuous maps on intervals of the real line, but it also ties to checkable conditions for Krieger's embedding theorem for symbolic dynamical systems. We begin by showing that while the Artin-Mazur zeta function of the system in principle contains this information entirely, it appears that extracting this information directly is far from trivial. If our system has a rational zeta function, we can classify for which n we have a periodic point of (not necessarily least) period n, by using the highly intricate Skolem-Mahler-Lech theorem. Moreover, we build on deep work on finitely presented (FP) systems and their relationship to symbolic dynamics to classify the set of least periods for arbitrary FP systems, and shifts of finite type. We also provide several constructions to realize any such least period sets.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2025-08-13
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0449650
|
URI | |
Degree (Theses) | |
Program (Theses) | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2025-11
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International