CORTEXA
← Browse
arxivmath.DScs.LGphysics.bio-ph2026-07-16

Ptolemy's Equant Equates to a Universal Dynamical Clock via Machine Learning

Jingdong Zhang, Luan Yang, Murilo S. Baptista, Zefeng Zhang, Qunxi Zhu, Wei Lin, Celso Grebogi

Oscillatory dynamics arise ubiquitously in nonlinear systems, yet identifying a physically interpretable phase and phase dynamics in nonlinear, high-dimensional oscillations remains a central unresolved problem. Here we establish the principle of a universal dynamical clock, a physical perspective in which oscillations of arbitrary dimensionality and geometry are equivalently represented as uniform rotation through an equant-induced nonlinear viewing coordinate, inspired by Ptolemy's equant and formalised through an areal-uniformity principle reminiscent of Kepler's second law. Using a machine-learning framework, we demonstrate the existence of such an equant for a broad class of oscillatory dynamics and construct the associated dynamical clock and phase dynamics under additive forces, including noise, periodic perturbations, and coupling. Its value in uncovering new physical rules and phenomena is demonstrated by four findings: (i) collective oscillations in Escherichia coli populations obey a previously unexplained superlinear scaling law, resolving a long-standing open problem posed in 2004; (ii) the response mechanisms of engineered genetic circuits to changes in gene expression and environmental conditions; (iii) a classical-mechanics counterpart of the Berry geometric phase emerges naturally from the phase of the dynamical clock; and (iv) optimal equant non-uniformity provides a geometric early-warning signal for critical transitions and enables prediction of critical parameters. By providing operational and system-agnostic phase dynamics that can be constructed directly from data, the dynamical clock enables principled classification, comparison, and control of oscillatory systems, and offers a new route to understanding how specific dynamical regimes support distinct functional behaviours in networked systems.

View free PDFSource page

Related papers

arxivcs.LGmath.DS2026-07-20

fSRD: Fuzzy Spectral Region Decomposition -- Automated Multi Operator Koopman Representations via an Adaptive Spectral Learning Architecture

Charles Bokor, Mark Cary, Denise Morrey, Fabrizio Bonatesta

Highly nonlinear chaotic dynamical systems remain difficult to model due to fundamental trade-offs between complexity, expressivity, and data efficiency. Modern machine learning methods achieve strong predictive performance but often rely on a-priori system knowledge or curated d…

View free PDFSource page
arxivcs.LGmath.DS2026-06-30

Learning dynamical systems from noisy data with Weak-form Kernel Ridge Regression

Max Kreider, John Harlim, Daning Huang

Accurate prediction of complex dynamical systems from noisy measurements remains a significant challenge in scientific computing. Kernel ridge regression learning strategies are often effective when applied to clean data, but have limited success with noisy data. Recent work has…

View free PDFSource page
arxivcs.LGmath.DSmath.SG2026-07-14

Learning Forced Multibody Dynamics on Lie Groups

Martine Dyring Hansen, Marta Ghirardelli, Elena Celledoni, David Martin de Diego, Brynjulf Owren

We propose an architecture for learning the dynamics of mechanical systems based on discrete forced Euler-Lagrange equations on Lie groups using only position data. By formulating the dynamics directly on manifold-valued configuration spaces, the method naturally respects the geo…

View free PDFSource page
arxivcs.LGcs.ITmath.CAmath.DS2026-06-25

Recovering Governing Equations from Solution Data: Identifiability Bounds for Linear and Nonlinear ODEs

Yang Pan, Helmut Bölcskei

Learning governing equations from observed solution data is a fundamental challenge in scientific machine learning, yet the theoretical conditions under which a ground-truth ODE can be uniquely and stably identified from multiple solution observations remain largely undeveloped,…

View free PDFSource page
arxivcs.GTcs.LGcs.MAmath.DSmath.OC2026-07-13

Paradoxes of Game Theoretic Equilibria and Price of Anarchy

Georgios Piliouras, Ian Gemp, Siqi Liu, Luke Marris

For decades, static solution concepts (Nash, Correlated, and Coarse Correlated Equilibria) and the Price of Anarchy (PoA) have formed the bedrock of algorithmic game theory, with no-regret learning proving fast convergence to such game-theoretic equilibria. We show that reducing…

View free PDFSource page
arxivmath.DScs.LGecon.TH2026-07-23

Natural Invariant Measures for Chaotic Game Dynamics: Finding Order in Chaos

Jakub Bielawski, Thiparat Chotibut, Fryderyk Falniowski, Michał Misiurewicz, Georgios Piliouras

We study the long-term behavior of the Multiplicative Weights Update (MWU) algorithm in game settings where learning dynamics frequently fail to converge to Nash equilibria and instead exhibit Li-Yorke chaos. While such chaos precludes the prediction of specific long-term strateg…

View free PDFSource page