Symbol sequences from three-rotor coincidences and their word-complexity

summary

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…

In short

The authors digitized classical three-rotor dynamics by recording successive coincidences of rotors using four symbols to capture orbit characteristics like periodicity and chaos. They found that periodic orbits have saturated word-complexity, while ultra-high energy and chaotic orbits exhibit complexity growing exponentially with a base of two, linking them to Sturmian sequences.

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 used across episodes

This episode discusses

The paper

Symbol sequences from three-rotor coincidences and their word-complexity · Read on arXiv

Chennai Mathematical Institute · University of Mumbai

DOI: 10.1063/5.0354972

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.

More episodes

← Home