Symbol sequences from three-rotor coincidences and their word-complexity
Chaos: An Interdisciplinary Journal of Nonlinear Science · 01.10.2026 · 36 (10)
DOI: 10.1063/5.0354972 ↗Kurz gefasst
Fachartikel in der Zeitschrift Chaos: An Interdisciplinary Journal of Nonlinear Science, online erschienen am 30.10.2026. Verfasst von Govind S Krishnaswami und 1 weiteren Autor:innen. Beteiligte Einrichtung: Physics Department, Chennai Mathematical Institute, SIPCOT IT Park, Siruseri 603103, India. Die Arbeit nennt 31 Literaturangaben. Gefördert von: Department of Science and Technology, Ministry of Science and Technology, India, Infosys Foundation.
Abstract (Originalsprache)
In the three-rotor problem, three equally massive point particles move on a circle interacting via attractive pairwise cosine potentials. Rotors can represent superconducting phases of metallic segments in a chain of coupled Josephson junctions. We propose a digitization of the classical dynamics that records successive pair and triple coincidences of rotors using four symbols. Rotor coincidences correspond to boundaries in a disjoint partition of the configuration torus into cells where the rotors are ordered clockwise and anticlockwise. It is shown that isolated rotor coincidences must be crossings. Despite being a rather coarse digitization, we find that replacing trajectories by coincidence symbol sequences captures significant qualitative features of the dynamics through word statistics. Word-complexity Cn measures the diversity of n-letter words in the symbol sequence while topological entropy governs asymptotic exponential growth of Cn. Sequences from periodic orbits have a word-complexity that saturates at the period. Ultrahigh-energy trajectories with irrational “slope” are quasiperiodic. We show that they have zero entropy and Cn = n + 3 by examining limiting slopes and by a mapping to Sturmian sequences. We examine their grammar rules and propose how their right-special words may be identified. On the other hand, numerical investigation of sequences from globally chaotic orbits leads us to conjecture an exponentially growing word-complexity Cn = 3 × 2n−1 with a topological entropy log2. We identify grammar rules that imply this conjectured word-complexity and model the resulting sequences as a subshift of finite type, unlike those at ultrahigh energies, which are not topological Markov chains.
Autor:innen und Institutionen
- Physics Department, Chennai Mathematical Institute, SIPCOT IT Park, Siruseri 603103, India.
- UM-DAE Centre for Excellence in Basic Sciences, University of Mumbai, Vidyanagari, Mumbai 400098, India.
ORCID-Profile: Govind S Krishnaswami, Anirudh Rameshan
Förderung
- Department of Science and Technology, Ministry of Science and Technology, India
- Infosys Foundation
Zitieren
APA
Krishnaswami, G. S., & Rameshan, A. (2026). Symbol sequences from three-rotor coincidences and their word-complexity. Chaos: An Interdisciplinary Journal of Nonlinear Science, 36(10). https://doi.org/10.1063/5.0354972
Vancouver
Krishnaswami GS, Rameshan A. Symbol sequences from three-rotor coincidences and their word-complexity. Chaos: An Interdisciplinary Journal of Nonlinear Science. 2026;36(10). doi:10.1063/5.0354972
BibTeX
@article{Krishnaswami2026,
author = {Krishnaswami, Govind S and Rameshan, Anirudh},
title = {Symbol sequences from three-rotor coincidences and their word-complexity},
journal = {Chaos: An Interdisciplinary Journal of Nonlinear Science},
year = {2026},
volume = {36},
number = {10},
doi = {10.1063/5.0354972}
}
EUVIMED