On least period sets of finitely presented dynamical systems

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.

Publication Details

Journal
Open Collections
Published
2025-01-01
DOI
https://doi.org/10.14288/1.0449650
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

On least period sets of finitely presented dynamical systems

Open Collections
Mathematical Dynamics and Fractals
article

On least period sets of finitely presented dynamical systems

article en

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.

Open Collections
Reduced inequalities
Openalex Percentile: Top 54%
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.

On least period sets of finitely presented dynamical systems · Open Collections (2025) | TGRS Research Map | TGRS