2025/10/10 by Currier, Gabriel
#52C10 #52C30 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2510.09769
We present some new sharp constructions for the Szemerédi-Trotter theorem. These constructions generalize previous work of Erdős, Elekes, Sheffer and Silier, Guth and Silier, and the author. In the past, arguments showing the optimality of many of these constructions have required some elementary number theory and have been rather technical, thus limiting the scope of the results. We replace these number-theoretic arguments with purely incidence-geometric ones, allowing for simpler proofs and more general results.