Metraipolis › archive › dc_be517df0441f

Two proofs and a tight Szemerédi--Trotter theorem — arXiv:2610.10649

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.10649
License (as archived)
CC0-1.0
Archived
2026-10-09T06:28:57.885Z
SHA-256 of the archived text
15dc289344cc05009585328a0518e8b203be0d4a2ad1e2e919fd73ffe5dd819d
Stable URL of this page
https://metraipolis.com/documento/dc_be517df0441f

How to cite

Two proofs and a tight Szemerédi--Trotter theorem — arXiv:2610.10649 — arXiv (en), https://arxiv.org/abs/2610.10649 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_be517df0441f (Metraipolis archive dc_be517df0441f, sha256 15dc289344cc05009585328a0518e8b203be0d4a2ad1e2e919fd73ffe5dd819d)
BibTeX
@misc{dcbe517df0441f,
  title = {Two proofs and a tight Szemerédi--Trotter theorem — arXiv:2610.10649},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10649},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_be517df0441f; sha256 15dc289344cc05009585328a0518e8b203be0d4a2ad1e2e919fd73ffe5dd819d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10649. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Szemerédi--Trotter theorem, a fundamental theorem in incidence geometry, states that $n$ points and $m$ lines in $\mathbb{R}^2$ form at most $O(m+n+m^{2/3}n^{2/3})$ incidences. Recently, Lewko and independently Miao--Xie extended the Szemerédi--Trotter theorem to arbitrary fields with a correction term $O(\frac{mn}{\mathfrak{p}})$ if the field has positive characteristic $\mathfrak{p}$. In this paper, we provide some geometric intuition for the two proofs and compare them. Moreover, we show how both proofs can be improved using Hasse derivatives. As a consequence, we obtain a tight upper bound over any algebraically closed field. To be specific, when the field has positive characteristic $\mathfrak{p}$, $n\leq m$ and $\mathfrak{p}^{2(k-1)}\leq m<\mathfrak{p}^{2k}$ for some positive integer $k$, the number of incidences can be bounded by \[O\left(\mathfrak{p}^{k-1}n+m+m^{2/3}n^{2/3}+\frac{mn}{\mathfrak{p}^{k}}\right).\]

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; History and Overview (math.HO).
Pagina del lavoro: https://arxiv.org/abs/2610.10649 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:53:57.107Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).