Constructions and explicit power savings for point--unit-circle incidences

Primarily AI-generated textHuman understanding: some partsmath.CO — Combinatoricsmath.NT — Number Theory

Contributed by Yuda Chen ↗, Yifei Wang ↗

Version 1 / Nov 15, 2026 / CC BY-SA 4.0

Abstract

Let U(n,m)\mathcal U(n,m) be the maximum number of incidences between nn distinct points and mm distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing s=min⁡(n,m)s=\min(n,m) and M=max⁡(n,m)M=\max(n,m), the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent 1.0411699201.041169920. The second gives balanced configurations along an unbounded sequence with exponent 1.04317223055397011.0431722305539701, and further unbalanced configurations. The upper bound is U(n,m)≪M+s2/3−2δM2/3+δ\mathcal U(n,m)\ll M+s^{2/3-2\delta}M^{2/3+\delta}, where δ=2−2664/514560000000>2−2665\delta=2^{-2^{664}}/514560000000>2^{-2^{665}}. 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

This work was developed through an iterative dialogue with GPT-6 Astra, with substantial AI involvement in exploring constructions and bounds, developing and revising mathematical arguments, and drafting the manuscript. The research questions and successive revisions were directed by the authors. Parallel AI agents were used to examine selected arguments, proof dependencies, and bibliographic sources. Web search was used to locate relevant literature and check reference information, with preference given to original papers and preprints. Python scripts assisted with manuscript processing and consistency checks, while LaTeX and BibTeX were used for typesetting, compilation, and reference management. The computational parts of the mathematical argument are presented through explicit algorithms, error estimates, and intermediate data in the manuscript.

Tools used

OpenAI
ChatGPTVersion 6 Astra

References

  1. Ágoston, Péter; Pálvölgyi, Dömötör. An improved constant factor for the unit distance problem. 2021. arXiv:2006.06285v3arXiv
  2. 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
  3. Aschenbrenner, Matthias. Ideal membership in polynomial rings over the integers. Journal of the American Mathematical Society, vol. 17, no. 2, pp. 407–441. 2004link
  4. Basu, Saugata; Pollack, Richard; Roy, Marie-Françoise. Algorithms in real algebraic geometry. Springer, vol. 10. 2006
  5. Bombieri, Enrico; Gubler, Walter. Heights in Diophantine geometry. Cambridge University Press, vol. 4. 2006
  6. 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
  7. Dokchitser, Tim. Computing special values of motivic LL-functions. Experimental Mathematics, vol. 13, no. 2, pp. 137–149. 2004
  8. Ellenberg, Jordan S.; Venkatesh, Akshay. Reflection principles and bounds for class group torsion. International Mathematics Research Notices, vol. 2007, pp. rnm002. 2007DOI
  9. Emmerich, Michael T. M. Optimizing explicit unit-distance lower-bound certificates. 2026. arXiv:2606.03419v5 (https://arxiv.org/abs/2606.03419v5), 9 June 2026arXivDOI
  10. Erdős, Paul. On sets of distances of nn points. The American Mathematical Monthly, vol. 53, no. 5, pp. 248–250. 1946DOI
Show all 44 referencesShow fewer references
  1. Ershov, Mikhail. Golod–Shafarevich groups: a survey. International Journal of Algebra and Computation, vol. 22, no. 5, pp. 1230001. 2012
  2. 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
  3. 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
  4. 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
  5. Hecke, Erich. Eine neue Art von Zetafunktionen und ihre Beziehungen zur Verteilung der Primzahlen. Zweite Mitteilung. Mathematische Zeitschrift, vol. 6, pp. 11–51. 1920DOI
  6. Jennings, S. A. The structure of the group ring of a pp-group over a modular field. Transactions of the American Mathematical Society, vol. 50, no. 1, pp. 175–185. 1941DOI
  7. 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
  8. Kollár, János. Sharp effective Nullstellensatz. Journal of the American Mathematical Society, vol. 1, no. 4, pp. 963–975. 1988DOI
  9. 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
  10. Matoušek, Jiří. Using the Borsuk–Ulam theorem: Lectures on topological methods in combinatorics and geometry. Springer. 2003DOI
  11. Milne, James S. Lectures on étale cohomology. 2013. Version 2.21, 22 March 2013link
  12. Milne, James S. Algebraic number theory. 2020. Version 3.08link
  13. Milne, James S. Class field theory. 2020. Version 4.03link
  14. Naslund, Eric. An exponent of 1.043 for the unit distance problem. 2026. hexagon:2610.00016v2, 8 October 2026hexagon
  15. Naslund, Eric. An improved explicit lower bound for the unit distance problem. 2026. Version recording the exponent 1.03583241.0358324; archived manuscript (https://github.com/enaslund/unit-distance-bound-0.0427/tree/8ab94da4ba4faf6f6d8fe43c298f04c3b284e796/papers/0.0358324). Unpublished manuscriptlink
  16. Neukirch, Jürgen; Schmidt, Alexander; Wingberg, Kay. Cohomology of number fields. Springer, vol. 323. 2008
  17. OpenAI. Planar point sets with many unit distances. 2026. Manuscript, 20 May 2026link
  18. 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
  19. Pach, János; Agarwal, Pankaj K. Combinatorial geometry. John Wiley & Sons. 1995DOI
  20. 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
  21. Poonen, Bjorn. Rational points on varieties. American Mathematical Society, vol. 186. 2017link
  22. Quillen, Daniel. On the associated graded ring of a group ring. Journal of Algebra, vol. 10, pp. 411–418. 1968
  23. 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
  24. rohanarun. Thirty edges: a joint linear system and bipartite rigidity. 2026. Research note, pull request 3, 10 October 2026link
  25. Rosser, J. Barkley; Schoenfeld, Lowell. Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics, vol. 6, pp. 64–94. 1962
  26. Sawin, Will. An explicit lower bound for the unit distance problem. 2026. arXiv:2605.20579v1arXiv
  27. Serre, Jean-Pierre. Linear representations of finite groups. Springer, vol. 42. 1977
  28. Sharir, Micha; Zahl, Joshua. Cutting algebraic curves into pseudo-segments and applications. Journal of Combinatorial Theory, Series A, vol. 150, pp. 1–35. 2017DOI
  29. Spencer, Joel; Szemerédi, Endre; Trotter, Jr., William T. Unit distances in the Euclidean plane. Graph Theory and Combinatorics, pp. 293–303. 1984link
  30. 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
  31. Szemerédi, Endre; Trotter, Jr., William T. Extremal problems in discrete geometry. Combinatorica, vol. 3, no. 3–4, pp. 381–392. 1983DOI
  32. 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
  33. 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
  34. 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

Version history

  1. v1 · 178 pagesSubmitted by Yuda ChenInitial depositCurrentNov 14, 2026