Searcharxiv⌕ Search

arXiv · 2610.19953

Almost-global convergence to twisted states in discrete Huygens rings

Abstract

We study the discrete Huygens phase map on the ring $C_n$, the simplest oscillator network in which the coupling can be frustrated. Reciprocal coupling favours phase opposition between neighbours, while the edge phase differences must sum to zero modulo $2π$ around the cycle; for odd $n$ these two requirements are incompatible. The parity of $n$ determines the absolute minima of the potential. When $4\mid n$, the critical set also contains circles of critical points, all of which meet at two completely degenerate configurations. After quotienting by the common phase, the map is a gradient step for an intrinsic potential on an $(n-1)$-torus, and the cycle spectrum gives an explicit interval of interaction strengths on which every orbit converges to a critical point. Our main result is that, on this whole interval and for every $n\ge3$, almost every orbit converges to a uniform twisted minimum, including at interaction strengths for which the map is not invertible. When $4\mid n$, the non-minimal points of the critical circles are treated by a centre-stable manifold argument. At the two degenerate intersections, a local blow-up reduces the problem to the cubic leading term of the potential and its restriction to the unit sphere. Orbits approaching along directions where this restriction is positive form a null set, because the cubic is harmonic in the intrinsic metric. No orbit approaches along its zero level, where the critical points are non-degenerate saddles on invariant rays. Hence the degenerate equilibria also have basins of zero measure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jorge Buescu, Henrique M. Oliveira. 2026-10-14. Almost-global convergence to twisted states in discrete Huygens rings. https://arxiv.org/abs/2610.19953

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

When is a System Discoverable from Data? Discovery Requires Chaos

The deep learning revolution has enabled major AI advances in physical sciences, particularly in discovering dynamical systems from observational data. Yet the reliability of learned surrogates and symbolically discovered models is often undermined by non-uniqueness: models may fit observed trajectories perfectly, but lack genuine predictive power. We show that chaos, despite its association with unpredictability, is often what makes governing equations discoverable. We prove that the classical Lorenz system is analytically discoverable and verify experimentally that for many systems out-of-domain generalization emerges precisely at chaos onset. Conservative systems, by contrast, are inherently non-discoverable from data alone. The prevalence of chaotic systems in benchmarks may have inadvertently obscured this limitation. These findings help explain why AI excels at weather forecasting, yet struggles in many engineering applications: the systems most amenable to discovery (chaotic ones) are often least amenable to control.

math.DS↗

Foliations and minimality for twist maps

In this paper we consider area-preserving twist maps $f:\mathbf{T}^2\to\mathbf{T}^2$ with vertical rotation sets reduced to a single irrational number $α$. Our first result states that under these hypotheses, there exists a unique $f$-invariant foliation $\mathcal{F}_G=\{\operatorname{Graph}(ϕ_t)\}_{t\in\mathbf{T}^1}$, where each function $ϕ_t:\mathbf{T}^1\to\mathbf{T}^1$ is $K$-Lipschitz for some constant $K=K(f)$. Moreover, we also prove that if $\mathcal{F}_G$ is a Lipschitz foliation, then $f$ is minimal.

math.DS↗

Uniqueness of Limit Cycles for Abel Equations and Planar Systems

We study positive limit cycles of the Abel equation $$\dot{x}=A(t)x^{3}+B(t)x^{2},$$ where $A$ and $B$ are $2π$-periodic functions. By developing a half-period convexity method, we establish a new criterion ensuring that the equation has at most one positive limit cycle. Moreover, if such a limit cycle exists, it is hyperbolic. As applications, we consider two classes of planar polynomial systems that can be reduced to Abel equations. For a subfamily of cubic rigid systems, we prove that there is at most one limit cycle, thereby giving a partial answer to the first problem in Gasull's list of 33 open problems. For quadratic systems, we derive a new uniqueness criterion for limit cycles surrounding the origin and provide explicit parameter regions under which the criterion is satisfied.

math.DS↗