Bandeira–Kireeva–Maillard–Rödder Kuramoto conjecture
Bandeira–Kireeva–Maillard–Rödder Kuramoto conjecture
For every , there exists a finite simple graph on vertices such that and is not globally synchronizing for the Kuramoto model; equivalently, the Kuramoto energy on has a local minimum other than a fully synchronized state.
Progress summary
A new unrefereed preprint claims the conjecture is false by showing synchronization below the three-quarter connectivity threshold.
The conjecture, formalized as Conjecture 5 in BKMR25, asserts that the sharp minimum-degree threshold for global Kuramoto synchronization is : for every , some graph with minimum degree at least is not globally synchronizing.
Known results
- Taylor (2011): a minimum-degree condition suffices.
- Bandeira, Ling, and Xu (2018): reduced the sufficient threshold to .
- A 2020 result reduced it to .
- Kassabov, Strogatz, and Townsend (2021): suffices; lower-bound constructions reached roughly .
August 2026 claimed refutation
An August 2026 arXiv preprint claims that graphs with connectivity are globally synchronizing, thereby explicitly refuting the Bandeira–Kireeva–Maillard–Rödder conjecture. The claim has not yet been independently verified.
Current status (as of August 2026): The upper bound and earlier lower bounds are established, while the conjecture is challenged by an unrefereed preprint whose claimed refutation remains unverified.
Sources
Sources & referencesView supporting material
Primary source
Additional references
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.