Search arXiv⌕ Search

arXiv · 2610.15686

**Winding number forces universal synchronisation**

Abstract

We prove that two completely different oscillators synchronise through arbitrarily weak reciprocal impulses. Any two planar oscillators with hyperbolic attracting limit cycles and equal natural periods lock stably one-to-one under translation impulses with generic directions and a suitable range of positive strength ratios, whatever their vector fields, limit cycles and transverse contraction rates. The mechanism is topological: the winding of the asymptotic phase gradient forces phase advances and delays, and the relative winding number of an effective impulse field gives lower bounds on attracting and unstable locked states. Equal periods are not essential: locking persists under small nonzero mismatches, with persistence and loss governed by a shifted phase balance. The analysis covers the full state-dependent impulsive dynamics, including transverse stability. Nearly simultaneous emissions may make the return discontinuous; under an explicit regularity condition the global return has a normally attracting Lipschitz invariant circle with topologically Morse--Smale dynamics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jorge Buescu, Henrique M. Oliveira. 2026-10-11. **Winding number forces universal synchronisation**. https://arxiv.org/abs/2610.15686

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↗