Paper
Zero entropy cycles on trees: from Topology to Combinatorics and an application to star maps
Authors
D. Juher, F. Mañosas, D. Rojas
Abstract
In this paper we give a fully combinatorial description of the zero entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of the pattern and provides, thus, a practical and fast algorithm to test zero entropy. As an application, consider a $k$-star $T$ (a tree with $k$ edges attached at a unique branching point of valence $k$) and the set $\mathcal{F}_{n,k}$ of all continuous maps $\map{f}{T}$ having a periodic orbit of period $n$ properly contained in $T$ (each edge of $T$ contains at least one point of the orbit). We find all pairs $(n,k)$ such that $\mathcal{F}_{n,k}$ contains maps of entropy zero, and we describe the patterns of such zero-entropy orbits.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2603.17598v1</id>\n <title>Zero entropy cycles on trees: from Topology to Combinatorics and an application to star maps</title>\n <updated>2026-03-18T11:13:16Z</updated>\n <link href='https://arxiv.org/abs/2603.17598v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2603.17598v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>In this paper we give a fully combinatorial description of the zero entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of the pattern and provides, thus, a practical and fast algorithm to test zero entropy. As an application, consider a $k$-star $T$ (a tree with $k$ edges attached at a unique branching point of valence $k$) and the set $\\mathcal{F}_{n,k}$ of all continuous maps $\\map{f}{T}$ having a periodic orbit of period $n$ properly contained in $T$ (each edge of $T$ contains at least one point of the orbit). We find all pairs $(n,k)$ such that $\\mathcal{F}_{n,k}$ contains maps of entropy zero, and we describe the patterns of such zero-entropy orbits.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='math.DS'/>\n <published>2026-03-18T11:13:16Z</published>\n <arxiv:comment>25 pages</arxiv:comment>\n <arxiv:primary_category term='math.DS'/>\n <author>\n <name>D. Juher</name>\n </author>\n <author>\n <name>F. Mañosas</name>\n </author>\n <author>\n <name>D. Rojas</name>\n </author>\n </entry>"
}