Constructions and explicit power savings for point--unit-circle incidences
Version 1 / Nov 15, 2026 / CC BY-SA 4.0
Abstract
Let be the maximum number of incidences between distinct points and distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing and , the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent . The second gives balanced configurations along an unbounded sequence with exponent , and further unbalanced configurations. The upper bound is , where . The constructions use two windows in a relative-norm-one number-field lattice, strengthened arithmetic estimates, and interpolation between local profiles. The upper bound uses finite incidence regularization, prediction, arithmetic heights, and a six-by-five rigidity obstruction. The resulting bounds for the unit-distance problem follow as corollaries.
Provenance statement
Tools used
- OpenAI
- ChatGPTVersion 6 Astra
References
- Ágoston, Péter; Pálvölgyi, Dömötör. An improved constant factor for the unit distance problem. 2021. arXiv:2006.06285v3arXiv
- Alon, Noga; Bloom, Thomas F.; Gowers, W. T.; Litt, Daniel; Sawin, Will; Shankar, Arul; Tsimerman, Jacob; Wang, Victor; Wood, Melanie Matchett. Remarks on the disproof of the unit distance conjecture. 2026. arXiv:2605.20695v1arXiv
- Aschenbrenner, Matthias. Ideal membership in polynomial rings over the integers. Journal of the American Mathematical Society, vol. 17, no. 2, pp. 407–441. 2004link
- Basu, Saugata; Pollack, Richard; Roy, Marie-Françoise. Algorithms in real algebraic geometry. Springer, vol. 10. 2006
- Bombieri, Enrico; Gubler, Walter. Heights in Diophantine geometry. Cambridge University Press, vol. 4. 2006
- Clarkson, Kenneth L.; Edelsbrunner, Herbert; Guibas, Leonidas J.; Sharir, Micha; Welzl, Emo. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry, vol. 5, pp. 99–160. 1990DOI
- Dokchitser, Tim. Computing special values of motivic -functions. Experimental Mathematics, vol. 13, no. 2, pp. 137–149. 2004
- Ellenberg, Jordan S.; Venkatesh, Akshay. Reflection principles and bounds for class group torsion. International Mathematics Research Notices, vol. 2007, pp. rnm002. 2007DOI
- Emmerich, Michael T. M. Optimizing explicit unit-distance lower-bound certificates. 2026. arXiv:2606.03419v5 (https://arxiv.org/abs/2606.03419v5), 9 June 2026arXivDOI
- Erdős, Paul. On sets of distances of points. The American Mathematical Monthly, vol. 53, no. 5, pp. 248–250. 1946DOI
Show all 44 referencesShow fewer references
- Ershov, Mikhail. Golod–Shafarevich groups: a survey. International Journal of Algebra and Computation, vol. 22, no. 5, pp. 1230001. 2012
- Golod, E. S.; Shafarevich, I. R. On the class field tower. Izv. Akad. Nauk SSSR Ser. Mat., vol. 28, no. 2, pp. 261–272. 1964. Russian; English translation in Amer. Math. Soc. Transl. (2) 48 (1965), 91–102link
- Guth, Larry; Katz, Nets Hawk. On the Erdős distinct distances problem in the plane. Annals of Mathematics, vol. 181, no. 1, pp. 155–190. 2015DOI
- Hajir, Farshid; Maire, Christian; Ramakrishna, Ravi. Cutting towers of number fields. Annales mathématiques du Québec, vol. 45, no. 2, pp. 321–345. 2021link
- Hecke, Erich. Eine neue Art von Zetafunktionen und ihre Beziehungen zur Verteilung der Primzahlen. Zweite Mitteilung. Mathematische Zeitschrift, vol. 6, pp. 11–51. 1920DOI
- Jennings, S. A. The structure of the group ring of a -group over a modular field. Transactions of the American Mathematical Society, vol. 50, no. 1, pp. 175–185. 1941DOI
- Kaplan, Haim; Matoušek, Jiří; Sharir, Micha. Simple proofs of classical theorems in discrete geometry via the Guth–Katz polynomial partitioning technique. Discrete & Computational Geometry, vol. 48, pp. 499–517. 2012link
- Kollár, János. Sharp effective Nullstellensatz. Journal of the American Mathematical Society, vol. 1, no. 4, pp. 963–975. 1988DOI
- Krick, Teresa; Pardo, Luis Miguel; Sombra, Martín. Sharp estimates for the arithmetic Nullstellensatz. Duke Mathematical Journal, vol. 109, no. 3, pp. 521–598. 2001link
- Matoušek, Jiří. Using the Borsuk–Ulam theorem: Lectures on topological methods in combinatorics and geometry. Springer. 2003DOI
- Milne, James S. Lectures on étale cohomology. 2013. Version 2.21, 22 March 2013link
- Milne, James S. Algebraic number theory. 2020. Version 3.08link
- Milne, James S. Class field theory. 2020. Version 4.03link
- Naslund, Eric. An exponent of 1.043 for the unit distance problem. 2026. hexagon:2610.00016v2, 8 October 2026hexagon
- Naslund, Eric. An improved explicit lower bound for the unit distance problem. 2026. Version recording the exponent ; archived manuscript (https://github.com/enaslund/unit-distance-bound-0.0427/tree/8ab94da4ba4faf6f6d8fe43c298f04c3b284e796/papers/0.0358324). Unpublished manuscriptlink
- Neukirch, Jürgen; Schmidt, Alexander; Wingberg, Kay. Cohomology of number fields. Springer, vol. 323. 2008
- OpenAI. Planar point sets with many unit distances. 2026. Manuscript, 20 May 2026link
- OpenAI. A power saving for planar unit distances. 2026. Preprint, 23 September 2026; official manuscript (https://github.com/openai/math/blob/main/preprints/A-power-saving-for-planar-unit-distances-September-23-2026/paper.pdf)link
- Pach, János; Agarwal, Pankaj K. Combinatorial geometry. John Wiley & Sons. 1995DOI
- Pach, János; Sharir, Micha. On the number of incidences between points and curves. Combinatorics, Probability and Computing, vol. 7, no. 1, pp. 121–127. 1998DOI
- Poonen, Bjorn. Rational points on varieties. American Mathematical Society, vol. 186. 2017link
- Quillen, Daniel. On the associated graded ring of a group ring. Journal of Algebra, vol. 10, pp. 411–418. 1968
- rohanarun. A smaller generic grid in the unit-distance argument. 2026. Eight-by-four grid version, 10 October 2026; manuscript source (https://github.com/rohanarun/unit-distance-grid-refinement/blob/main/proof.tex). Research manuscriptlink
- rohanarun. Thirty edges: a joint linear system and bipartite rigidity. 2026. Research note, pull request 3, 10 October 2026link
- Rosser, J. Barkley; Schoenfeld, Lowell. Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics, vol. 6, pp. 64–94. 1962
- Sawin, Will. An explicit lower bound for the unit distance problem. 2026. arXiv:2605.20579v1arXiv
- Serre, Jean-Pierre. Linear representations of finite groups. Springer, vol. 42. 1977
- Sharir, Micha; Zahl, Joshua. Cutting algebraic curves into pseudo-segments and applications. Journal of Combinatorial Theory, Series A, vol. 150, pp. 1–35. 2017DOI
- Spencer, Joel; Szemerédi, Endre; Trotter, Jr., William T. Unit distances in the Euclidean plane. Graph Theory and Combinatorics, pp. 293–303. 1984link
- Székely, László A. Crossing numbers and hard Erdős problems in discrete geometry. Combinatorics, Probability and Computing, vol. 6, no. 3, pp. 353–358. 1997link
- Szemerédi, Endre; Trotter, Jr., William T. Extremal problems in discrete geometry. Combinatorica, vol. 3, no. 3–4, pp. 381–392. 1983DOI
- Tate, John T. Fourier analysis in number fields and Hecke's zeta-functions. Algebraic Number Theory, pp. 305–347. 1967. Originally a Princeton University doctoral thesis, 1950
- Tseng. Certified pointwise lower bound for the Erdős unit-distance problem: proof package. 2026. Version 1.0.0, 23 May 2026; doi:10.5281/zenodo.20357019 (https://doi.org/10.5281/zenodo.20357019). ZenodoDOI
- Tsfasman, M. A.; Vlăduţ, S. G. Infinite global fields and the generalized Brauer–Siegel theorem. Moscow Mathematical Journal, vol. 2, no. 2, pp. 329–402. 2002DOI