clopen.solutions

A sharp Fourier certificate for planar circle packing

Recorded by the registry's curators from GitHub; the authors did not submit it here.

OpenAI

We resolve the planar Cohn--Elkies sharpness conjecture: the two-point Fourier bound attains the optimal circle-packing density $\pi/(2\sqrt3)$. We construct a radial Schwartz certificate and prove its global sign conditions using rigorous interval arithmetic and analytic estimates. The same certificate recovers the classical uniqueness of the triangular packing among periodic equality cases.

Claims

SOLUTION CLAIMED OP-01134 — Sharpness of the Cohn–Elkies bound for circle packings
Full resolution · fidelity not yet established

Files and sources

Paper
math @ 4eaee87, build/main.tex ↗
Posted on GitHub
6 October 2026

No verification run is on record for this version.