Abstract
We study a lower bound for the constant of the Szemerédi–Trotter theorem. In particular, we show that a recent infinite family of point-line configurations satisfies I(P,L)≥(c+o(1))|P|2/3|L|2/3, with c≈1.27. Our technique is based on studying a variety of properties of Euler's totient function. We also improve the current best constant for Elekes's construction from 1 to about 1.27. From an expository perspective, this is the first full analysis of the constant of Erdős's construction.
Original language | English |
---|---|
Article number | 102009 |
Journal | Computational Geometry: Theory and Applications |
Volume | 114 |
DOIs | |
State | Published - 1 Oct 2023 |
Externally published | Yes |
Keywords
- Integer lattice
- Point-line incidence
- Szemerédi–Trotter theorem
- Totient function
ASJC Scopus subject areas
- Computer Science Applications
- Geometry and Topology
- Control and Optimization
- Computational Theory and Mathematics
- Computational Mathematics