Mathematicians Near Proof of 200-Year-Old Gauss Cycle Conjecture

Harvard mathematician Aaron Landesman and IAS Clay Research Fellow Ishan Levy have built a framework that largely settles the centuries-old Gauss cycle problem by proving the Cohen-Lenstra conjecture on average cycle length.

Carl Friedrich Gauss introduced a composition operation for quadratic forms that inevitably cycles back to the original form, yet he left the cycle’s duration unexplained. The Cohen-Lenstra conjecture of 1983 proposed that, on average, a family of such forms resets after a single step for any prime greater than two, but a proof remained elusive. Building on earlier, partially retracted work by Ellenberg, Venkatesh and Westerland, Aaron Landesman and Ishan Levy combined ideas from homotopy theory, probability and algebraic geometry to construct matrices that stabilize as predicted, thereby confirming the conjecture.

Their 2024 arXiv submission has been widely accepted as a valid proof. The breakthrough also enabled them to address the Poonen-Rains conjecture on elliptic-curve statistics and Malle’s conjecture on symmetry types in number fields, at least in function-field settings. Colleagues such as Melanie Wood anticipate the new framework becoming a standard tool in arithmetic statistics, while the work highlights the growing influence of homotopy theory across mathematics.