Symbol sequences from three-rotor coincidences and their word-complexity
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Nonlinear Sciences. The day in nonlinear science: chaos, patterns, networks and adaptation.
Kai: We're looking at the paper: "Symbol sequences from three-rotor coincidences and their word-complexity".
Mira: Here's the gist of the paper. Symbol sequences from three-rotor coincidences and their word-complexity proposes a digitization of classical three-rotor dynamics that records successive pair and triple coincidences using four symbols to capture qualitative features of periodic, quasiperiodic, and chaotic orbits <ref:2606.25766#pg11>.
Kai: Digitization Methodology The authors propose a digitization of the classical three-rotor problem by recording successive pair and triple coincidences of rotors using four symbols <ref:2606.25766#pg5>.
Mira: Rotor coincidences correspond to boundaries in a disjoint partition of the configuration torus into cells where the rotors are ordered clockwise and anticlockwise <ref:2606.25766#pg12>.
Kai: The alphabet used for this digitization is A = 0, 1, 2, 3, where symbol 0 corresponds to a triple coincidence <ref:2606.25766#pg6>.
Paper summary: Kai: So, we're looking at this paper called "Symbol sequences from three-rotor coincidences and their word-complexity." It proposes digitizing the classical dynamics of the three-rotor problem by recording successive pair and triple coincidences of rotors using four symbols.
Mira: It claims that this method captures significant qualitative features of the dynamics, even though it's a rather coarse digitization compared to just sampling trajectories at equal times.
Lev: From an engineering standpoint, using four symbols means we are mapping the configuration torus into cells based on the clockwise or anticlockwise ordering of those rotors, which essentially tells us where they are relative to each other one <ref:2606.25766#pg2>.
Kai: That's right. The core idea is that these rotor coincidences correspond to boundaries in a partition of the configuration torus, and isolated rotor coincidences must be crossings <ref:2606.25766#pg1>. They are trying to capture the qualitative behavior of periodic, quasiperiodic, and chaotic orbits through these sequences.
Mira: The paper then looks at what happens with these symbol sequences when the system is in a periodic orbit, and they find that the word-complexities saturate at the period of those corresponding sequences <ref:2606.25766#pg10>. For instance, for pendulum sequences, the paper finds a period p equals two and a constant Cn equals two <ref:2606.25766#pg11>.
Lev: That saturation point is interesting because it suggests that for periodic behavior, you don't get infinitely complex sequences in terms of word complexity. For breathers, they find constant word-complexities of one and two respectively <ref:2606.25766#pg10>.
Kai: But then things get really interesting when we look at ultra-high energy trajectories. The authors conjecture that the word-complexity for these trajectories grows exponentially, specifically as Cn equals three times two to the power of n minus one, and this corresponds to a topological entropy of log two <ref:2606.25766#pg11>.
Mira: They derive this by mapping those ultra-high energy quasiperiodic rotor-coincidence sequences onto Sturmian sequences, and they link the word-complexity Cn of the ultra-high energy sequences to the word-complexity Cs equals n plus one of Sturmian sequences <ref:2606.25766#pg11>.
Lev: If you were trying to run this on real hardware, that exponential growth means you're dealing with a lot of complexity that might be hard to model directly, and the connection to Sturmian sequences is what bridges the gap between the continuous dynamics and this discrete symbolic representation <ref:2606.25766#pg11>.
Kai: Now for chaotic trajectories in the band of global chaos, they conjecture a word-complexity of Cn equals three times two to the power of n minus one, which again corresponds to a topological entropy h equals log two <ref:2606.25766#pg11>.
Mira: The paper supports this conjecture by examining the grammar rules and modeling them as a subshift of finite type, which is different from how they modeled the ultra-high energy quasiperiodic sequences, which can't be modeled as a topological Markov shift <ref:2606.25766#pg11>.
Lev: So for chaotic dynamics, they suggest that only two grammar rules are needed to model it as a subshift of finite type—the absence of zeros and symbol repetitions—which implies there has to be some kind of arbitrarily long memory or grammar involved <ref:2606.25766#pg11>.
Paper summary: Kai: The connection they make between the ultra-high energy sequences and Sturmian sequences is based on choosing relative angles like phi one equals two pi x, phi two equals two pi y, and the slope sigma equals alpha <ref:2606.25766#pg11>.
Mira: And they show that the word-complexity Cn for ultra-high energy quasiperiodic rotor sequences is given by n plus three when n is odd greater than one, and also n plus three when n is even <ref:2606.25766#pg11>. This relationship comes from the properties of Sturmian sequences where Cs equals n plus one <ref:2606.25766#pg11>.
Lev: If we were actually looking at those sequences on a real hardware setup, the word frequency analysis shows that the word frequencies rapidly approach asymptotic values and take at most three distinct nonzero values, which is similar to what you see in Sturmian sequences <ref:2606.25766#pg11>.
Kai: For the generic trajectories in the globally chaotic band, they suggest a word-complexity of Cn equals three times two to the power of n minus one, and this complexity corresponds to a topological entropy h equals log two <ref:2606.25766#pg11>.
Mira: The word frequency analysis for this generic chaotic band shows that all three one words occur with the same frequency of one over three, and all six two words occur with a frequency of one over six <ref:2606.25766#pg11>.
Lev: That means if you had to run simulations on real hardware for these trajectories, you'd be looking at a word distribution that is highly structured in terms of those counts <ref:2606.25766#pg11>.
Kai: So, the paper concludes that the digitization of classical three-rotor dynamics provides a framework to analyze the complexity across different regimes, yielding word complexities that saturate for periodic orbits, grow linearly for ultra-high energy quasiperiodic orbits, and follow Cn equals three times two to the power of n minus one for chaotic orbits in the band of global chaos <ref:2606.25766#pg11>.
Mira: The main implication is that this symbolic approach gives us a way to quantify how complex different types of motion are in these systems, using word complexity as a measure, even when the underlying dynamics are very difficult to analyze directly.
Lev: What the paper doesn't cover is whether that conjecture about the unique right-special n word can actually be established or if it's just a guess for those ultra-high energy quasiperiodic orbits <ref:2606.25766#pg11>.
Kai: Yeah, and preliminary investigations show some patterns in the word-complexity of those ultra-high energy trajectories that are quite different from what was found in the globally chaotic band <ref:2606.25766#pg11>.
Mira: The authors suspect that the sequences at ultra-high energies and in the globally chaotic energy band might just be two extreme cases where we can find relatively simple interpretations, and they think richer symbolic dynamics could exist in other regimes of the three-rotor problem <ref:2606.25766#pg11>.
Lev: That suggests that whatever symbols you use to capture this system, you need to be ready for complexity outside those two extremes <ref:2606.25766#pg11>.
Conclusion: Kai: So, we've been looking at how they used rotor coincidences to create these symbol sequences from three rotors and what those word complexities tell us about different types of motion.
Mira: Exactly, it’s about taking a classical problem and turning it into a language of symbols to see the underlying structure of periodic versus chaotic movement.
Lev: They digitized the dynamics by looking at when the rotors line up in specific ways—pair coincidences and triple coincidences—and assigning four symbols to those events.
Kai: It boils down to seeing how complex those symbol sequences get, because that complexity tells us whether we’re looking at something simple or something truly chaotic.
Mira: For periodic orbits, the complexity just settles down at a specific number related to the orbit's period, which is pretty neat because it predicts the limit of their information content for those systems.
Lev: For ultra-high energy orbits, they found this complexity grows exponentially with an exponent related to their trajectory index and this growth links directly to Sturmian sequences in a way that’s mathematically rigorous.
Kai: So the paper basically shows us how you can use these symbolic measures to distinguish between simple motion, like pendulum swings, and the much more complex dynamics happening at very high energies.
Mira: And they also found that for chaotic orbits in the global chaos band, the complexity follows that same exponential growth pattern we saw in those ultra-high energy cases.
Lev: The big implication is showing a unified symbolic framework where different regimes—periodic, quasiperiodic, and chaotic—all have predictable complexity scaling based on their underlying dynamics.
Kai: It suggests that even in these complicated rotor systems, there’s a consistent mathematical rule governing how complex the motion can get depending on what kind of trajectory you are observing.
Chennai Mathematical Institute · University of Mumbai
nlin.CD, math-ph, math.DS, math.MP
Submitted: 2026-06-24
Updated: 2026-11-03
Comments: 27 pages and 18 figure files
Journal ref: Chaos 36, 103140 (2026)
DOI: 10.1063/5.0354972
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 80/100
The gist: Symbol sequences from three-rotor coincidences and their word-complexity proposes a digitization of classical three-rotor dynamics that records successive pair and triple coincidences using four…
Key concepts
- Rotor Coincidences
- These are events where the three rotors align in specific clockwise or anticlockwise orders. These coincidences define boundaries in a configuration space partition, allowing the system's state to be qualitatively described by four symbols (0-3).
- Word-Complexity (Cn)
- This measures the diversity of patterns within a sequence of symbols. It quantifies how many different n-letter words appear in the sequence, helping to distinguish between different dynamical regimes like periodic, quasiperiodic, and chaotic orbits.
- Topological Entropy (h)
- This concept measures the exponential rate at which distinct patterns or complexity grows over time. For chaotic trajectories, the paper conjectures a topological entropy of log 2, indicating a specific level of complexity growth.
Terminology
Summary
Symbol sequences from three-rotor coincidences and their word-complexity proposes a digitization of classical three-rotor dynamics that records successive pair and triple coincidences using four symbols to capture qualitative features of periodic, quasiperiodic, and chaotic orbits <ref:2606. p. 125766#pg11>.
Digitization Methodology
The authors propose a digitization of the classical three-rotor problem by recording successive pair and triple coincidences of rotors using four symbols <ref:2606.25766#pg5>. Rotor coincidences correspond to boundaries in a disjoint partition of the configuration torus into cells where the rotors are ordered clockwise and anticlockwise <ref:2606. p. 025766#pg12>. The alphabet used for this digitization is A = 0, 1, 2, 3, where symbol 0 corresponds to a triple coincidence <ref:2606. p. 125766#pg6>. This sequence captures many qualitative properties of periodic, quasiperiodic and chaotic trajectories despite being a rather coarse discretization compared to equal-time sampling <ref:2606. p. 225766#pg2>.
Analysis of Periodic Orbits
Symbol sequences from static and simple periodic orbits have word-complexities that saturate at the period of the corresponding sequence <ref:2606.25766#pg10>. For example, pendulum sequences have a period p = 2 and constant Cn = 2 <ref:2606. p. 925766#pg11>. Librational breathers and rotational breathers have word-complexities Cn = 1 and Cn = 2 respectively <ref:2606. p. 725766#pg10>. Small oscillations around the ground state G yield 3-periodic sequences with Cn = 3 <ref:2606. p. 225766#pg10>.
Ultra-High-Energy Orbits
For ultra-high energy (UHE) trajectories, the authors conjecture an exponentially growing word-complexity Cn = 3 × 2(n−1), corresponding to a topological entropy h = log 2 <ref:2606.25766#pg11>. This formula is derived by mapping UHE quasiperiodic rotor-coincidence sequences to Sturmian sequences <ref:2606. p. 325766#pg11>. The connection is established by relating the word-complexity Cn of UHE quasiperiodic rotor sequences to the word-complexity Cs = n+1 of Sturmian sequences <ref:2606. p. 325766#pg11>.
Chaotic Trajectories
Numerical investigation of sequences from chaotic orbits in the band of global chaos leads to the conjecture that their word-complexity is Cn = 3 × 2(n−1), corresponding to a topological entropy h = log 2 <ref:2606.25766#pg11>. This conjecture is supported by examining the grammar rules and modeling them by a subshift of finite type, unlike the quasiperiodic ultra-high-energy sequences which cannot be modeled as a topological Markov shift <ref:2606. p. 025766#pg11>.
Word Statistics and Grammar Rules
The word-complexity Cn measures the diversity of n-letter words in the symbol sequence while topological entropy governs asymptotic exponential growth of Cn <ref:2606.25766#pg11>. For chaotic trajectories, the grammar rules suggest that only two rules—absence of 0s and symbol repetitions—are needed to model them as a subshift of finite type <ref:2606. p. 025766#pg11>. The conjectured absence of more than one branching suggests there must be grammar rules involving arbitrarily long words or having arbitrarily long ‘memory’ <ref:2606. p. 025766#pg11>.
Connection to Sturmian Sequences
The connection between UHE quasiperiodic rotor-coincidence sequences and Sturmian sequences is established by choosing the relative angles as φ1 = 2πx, φ2 = 2πy and slope σ = α <ref:2606.25766#pg11>. The word-complexity Cn of UHE quasiperiodic rotor sequences is shown to be given by Cn = n + 3 for odd n > 1 and Cn = n + 3 for even n <ref:2606. p. 025766#pg11>. This relationship is derived from the properties of Sturmian sequences where C s n = n+1 <ref:2606. p. 325766#pg11>. The word-frequency analysis shows that the word-frequencies rapidly approach asymptotic values and take at most three distinct nonzero values, similar to Sturmian sequences <ref:2606. p. 325766#pg11>.
Chaotic Band Complexity
The conjectured word-complexity for generic trajectories in the globally chaotic band is Cn = 3 × 2(n−1) <ref:2606.25766#pg11>. This complexity corresponds to a topological entropy h = log 2 <ref:2606. p. 325766#pg11>. The analysis of word-frequency shows that all three 1-words occur with the same frequency 1/3, as do all six 2-words (1/6) <ref:2606. p. 225766#pg11>.
Discussion Points
Open questions raised by the work include whether the conjecture on the unique right-special n-word can be established or falsified for symbol sequences of UHE quasiperiodic orbits <ref:2606.25766#pg11>. It is also noted that preliminary investigations indicate interesting patterns in the word-complexity of such trajectories that are quite different from what was found at ultra-high energies <ref:2606. p. 025766#pg11>. The authors suspect that the sequences found at ultra-high energies and in the globally chaotic energy band are but two extreme cases for which relatively simple interpretations and explanations could be found <ref:2606. p. 025766#pg11>. The paper suggests that richer symbolic dynamics may exist in other regimes of the three-rotor problem <ref:2606. p. 125766#pg11>.
Conclusion
The digitization of classical 3-rotor dynamics through rotor coincidences provides a framework to analyze the complexity of various dynamical regimes, yielding word complexities that saturate for periodic orbits, grow linearly for ultra-high energy quasiperiodic orbits, and are conjectured to follow Cn = 3 × 2(n−1) for chaotic orbits in the band of global chaos <ref:2606.25766#pg11>.
References
[1] Lorenz, E. N., Deterministic nonperiodic flow, J. p. 1 p. 1 Atmos. Sci. 20, 130 (1963) <ref:2606. p. 0 p. 025766#pg11> [2] Hadamard, J. p. 1 p. 1, Les surfaces courbures opposées et leurs lignes géodésiques, Journal de Mathématiques Pures et Appliquées 4, 27-73 (1898) <ref:2606.25766#pg11> [3] Birkhoff, G. p. 1 p. 1 D., Dynamical Systems, American Mathematical Society (1927) <ref:2606.25766#pg11> [4] Morse, M. p. 1 p. 1 and Hedlund, G. p. 1 p. 1 p. 1 p. 1 A., Symbolic dynamics, Amer. p. 1 p. 1 J. Math. 60, 815–866 (1938) <ref:2606. p. 0 p. 025766#pg11> [5] Morse, M. p. 1 p. 1 and Hedlund, G. A., Symbolic dynamics II. p. 1 p. 1 Sturmian trajectories, Amer. p. 0 p. 0 J. Math. 62, 1-42 (1940) <ref:2606. p. 0 p. 025766#pg11> [6] Hao, B., Symbolic dynamics and characterization of complexity, Physica D 51, 161-176 (1991) <ref:2606. p. 1 p. 125766#pg11> [7] Arioli, G., Periodic orbits, symbolic dynamics and topological entropy for the restricted 3-body problem, Commun. p. 1 p. 1 Math. Phys. 231, 1-24 (2002) <ref:2606. p. 0 p. 025766#pg11> [8] Hirata, Y. and Mees, A. I., Estimating topological entropy via a symbolic data compression technique, Phys. p. 3 p. 3 Rev. E 67, 026205 (2003) <ref:2606. p. 0 p. 025766#pg11> [9] Matsuoka, C. and Hiraide, K., Computation of entropy and Lyapunov exponent by a shift transform, Chaos 25(10), 103110 (2015) <ref:2606. p. 0 p. 025766#pg11> [10] Day, S., Frongillo, R. and Trevino, R., Algorithms for rigorous entropy bounds and symbolic dynamics, SIAM J. p. 1 p. 1 Applied Dynamical Systems 7(4), 477-1506 (2008) <ref:2606. p. 0 p. 025766#pg11> [11] Ampilova, N. and Soloviev, I., On a method of applied symbolic dynamics for investigation of dynamical systems, Vibroengineering Procedia 25(4), 128-134 (2019) <ref:2606. p. 125766#pg11> [12] Lind, D. and Marcus, B., An Introduction to Symbolic Dynamics and Coding, 2nd Ed. p. 1 p. 1, Cambridge University Press (1995) <ref:2606. p. 0 p. 025766#pg11> [13] Fogg, N. P., Substitutions in Dynamics, Arithmetics and Combinatorics, Vol. p. 0 p. 0 1794 of Lecture Notes in Mathematics, Eds. Berth´e, V., Ferenczi S., Mauduit, C. and Siegel A., Springer-Verlag (2002) <ref:2606. p. 0 p. 025766#pg11> [14] Marcus, B. and Williams, S., Symbolic dynamics, Scholarpedia 3(11):2923 (2008) <ref:2606. p. 1 p. 125766#pg11> [15] Hao, B. and Zheng, W., Applied Symbolic Dynamics and Chaos, 2nd Ed. p. 1 p. 1, World Scientific (2018) <ref:2606. p. 0 p. 025766#pg11> [18] Montgomery, R., Infinitely many syzygies Arch. p. 1 p. 1 Ration. Mech. Anal. 164 311-40 (2002) <ref:2606. p. 0 p. 025766#pg11> [19] Dullin, H. R. and Montgomery, R., Syzygies in the two center problem, Nonlinearity 29, 1212-1237 (2016) <ref:2606. p. 1 p. 125766#pg11> [20] Adler, R., Downarowicz, T. and Misiurewicz, M., Topological entropy, Scholarpedia, 3(2):2200 (2008) <ref:2606. p. 0 p. 025766#pg11> [21] Catalan, T., A link between topological entropy and Lyapunov exponents, Ergodic Theory and Dynamical Systems 39(3), 620-637 (2019) <ref:2606. p. 1 p. 125766#pg11> [22] Krishnaswami, G. S. and Senapati, H., Classical three rotor problem: periodic solutions, stability and chaos, Chaos 29 (12), 123-1<ref:2606. p. 1 p. 125766#pg11> [30] Katok, A. and Hasselblatt, B., Introduction to modern theory of dynamical systems, Cambridge University Press (1995) <ref:2606.25766#pg11>
[1] Lorenz, E. N., Deterministic nonperiodic flow, J. Atmos. Sci. 20, 130 (1963) <ref:2606.25766#pg11> [2] Hadamard, J., Les surfaces courbures opposées et leurs lignes géodésiques, Journal de Mathématiques Pures et Appliquées 4, 27-73 (1898) <ref:2606.25766#pg11> [3] Birkhoff, G. D., Dynamical Systems, American Mathematical Society (1927) <ref:2606.25766#pg11> [4] Morse, M. and Hedlund, G. A., Symbolic dynamics, Amer. J. Math. 60, 815–866 (1938) <ref:2606.25766#pg11> [5] Morse, M. and Hedlund, G. A., Symbolic dynamics II. Sturmian trajectories, Amer. J. Math. 62, 1-42 (1940) <ref:2606.25766#pg11> [6] Hao, B., Symbolic dynamics and characterization of complexity, Physica D 51, 161-176 (1991) <ref:2606.25766#pg11> [7] Arioli, G., Periodic orbits, symbolic dynamics and topological entropy for the restricted 3-body problem, Commun. Math. Phys. 231, 1-24 (2002) <ref:2606.25766#pg11> [8] Hirata, Y. and Mees, A. I., Estimating topological entropy via a symbolic data compression technique, Phys. Rev. E 67, 026205 (2003) <ref:2606.25766#pg11> [9] Matsuoka, C. and Hiraide, K., Computation of entropy and Lyapunov exponent by a shift transform, Chaos 25(10), 103110 (2015) <ref:2606.25766#pg11> [10] Day, S., Frongillo, R. and Trevino, R., Algorithms for rigorous entropy bounds and symbolic dynamics, SIAM J. Applied Dynamical Systems 7(4), 477-1506 (2008) <ref:2606.25766#pg11> [11] Ampilova, N. and Soloviev, I., On a method of applied symbolic dynamics for investigation of dynamical systems, Vibroengineering Procedia 25(4), 128-134 (2008) <ref:2606. p. 125766#pg11> [12] Lind, D. and Marcus, B., An Introduction to Symbolic Dynamics and Coding, 2nd Ed., Cambridge University Press (1995) <ref:2606.25766#pg11> [13] Fogg, N. P., Substitutions in Dynamics, Arithmetics and Combinatorics, Vol. 1794 of Lecture Notes in Mathematics, Eds. Berth´e, V., Ferenczi S., Mauduit, C. and Siegel A., Springer-Verlag (2002) <ref:2606.25766#pg11> [14] Marcus, B. and Williams, S., Symbolic dynamics, Scholarpedia 3(11):2923 (2008) <ref:2606.25766#pg11> [15] Hao, B. and Zheng, W., Applied Symbolic Dynamics and Chaos, 2nd Ed., World Scientific (2018) <ref:2606.25766#pg11> [18] Montgomery, R., Infinitely many syzygies Arch. Ration. Mech. Anal. 164 311-40 (2002) <ref:2606.25766#pg11> [19] Dullin, H. R. and Montgomery, R., Syzygies in the two center problem, Nonlinearity 29, 1212-1237 (2016) <ref:2606.25766#pg11> [20] Adler, R., Downarowicz, T. and Misiurewicz, M., Topological entropy, Scholarpedia, 3(2):2200 (2008) <ref:2606.25766#pg11> [21] Catalan, T., A link between topological entropy and Lyapunov exponents, Ergodic Theory and Dynamical Systems 39(3), 620-637 (2019) <ref:2606.25766#pg11> [22] Krishnaswami, G. S. and Senapati, H., Classical three rotor problem: periodic solutions, stability and chaos, Chaos 29 (12), 123-1<ref:2606.25766#pg11> [30] Katok, A. and Hasselblatt, B., Introduction to modern theory of dynamical systems, Cambridge University Press (1995) <ref:2606.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Digitization of classical dynamics for three-rotor systems allows AI to analyze complex physical phenomena by replacing trajectories with symbol sequences from a four-letter alphabet, enabling quantification of qualitative features across periodic, quasiperiodic, and chaotic orbits.
-
AI systems can predict word complexity using the conjectured formulas Cn = n + 3 for ultra-high energy quasiperiodic orbits and Cn = 3 times 2 to the power of n minus one for trajectories in the band of global chaos.
-
AI can model grammar rules for UHE symbolic dynamics by incorporating constraints such as
alternating 2s
and forbidding certain symbols, allowing it to construct sequences that match observed word statistics. -
AI can establish a correspondence between UHE quasiperiodic rotor-coincidence sequences and Sturmian sequences to infer the word complexity formula Cn = n + 3 for irrational slopes.
-
AI systems can approximate UHE periodic orbits by using finite energy orbits, matching the resulting symbol sequence word-complexity and word-frequencies with those of the true UHE orbit, despite numerical approximations being difficult for high energy.
Related papers
- PRISM: Unifying multiphysics optothermal transport and identifiability-guided inference for nanoscale thermal metrology
- Quantifying The Complex Spatiotemporal Chaos of Cardiac Fibrillation in Ionic Models Across Parameter Regimes
- Modal interactions in strongly nonlinear coupled oscillators with closely spaced modes and nonclassical damping distribution
- An active Lorentz gas: walking droplets in periodic media
- Stochastic-layer width as an order parameter for the integrability-to-chaos transition in the bouncer model
- When more data become less informative: Finite-precision periodicization and collapse of forecast-error Lyapunov estimates