Govind S. Krishnaswami
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Govind S. Krishnaswami has a total of 144 co-authors. Here are the top co-authors by number of shared publications:
- Himalaya Senapati
Physics Department Chennai Mathematical Institute SIPCOT IT Park 603103 Siruseri India
11 shared publications - T. R. Vishnu
Raman Research Institute
9 shared publications - Sonakshi Sachdev
Physics Department Chennai Mathematical Institute SIPCOT IT Park 603103 Siruseri India
8 shared publications - Anantanarayanan Thyagaraja
Astrophysics Group University of Bristol BS8 1TL Bristol UK
7 shared publications - Sarada. G. Rajeev
Department of Physics and Astronomy University of Rochester Rochester 14627 New York USA
6 shared publications - Abhijit Sen
Institute for Plasma Research
5 shared publications
Latest Publications
- 1 October 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (10)
Symbol sequences from three-rotor coincidences and their word-complexity
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.
- 1 October 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (10)
Symbol sequences from three-rotor coincidences and their word-complexity
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.
- 31 July 2025
- Published by Springer Nature
- p. 425-462
Normal Modes of Oscillation and Linear Stability
- 31 July 2025
- Published by Springer Nature
- p. 479-534
From Regular to Chaotic Motion
- 31 July 2025
- Published by Springer Nature
- p. 333-376
Canonical Transformations
- 31 July 2025
- Published by Springer Nature
- p. 591-646
Introduction to Fluid Mechanics
- 31 July 2025
- Published by Springer Nature
- p. 647-681
Mathematical and Kinematical Background
- 31 July 2025
- Published by Springer Nature
- p. 189-214
Dynamics Viewed as a Vector Field on State Space
- 31 July 2025
- Published by Springer Nature
- p. 405-423
Hamilton-Jacobi Equation
- 31 July 2025
- Published by Springer Nature
- p. 249-269
Nonlinear Oscillations: Pendulum and Anharmonic Oscillator
- 31 July 2025
- Published by Springer Nature
- p. 249-269
Nonlinear Oscillations: Pendulum and Anharmonic Oscillator
- 31 July 2025
- Published by Springer Nature
- p. 1-22
Mechanical Systems with One Degree of Freedom