For infinitely many primes p there is a choice of c such that no square of side sqrt(0.1 log p) contains two points, giving a sqrt(log p) lower bound for the guaranteed side length.
Chang, On a question of Davenport and Lewis and new character sum bounds in finite fields, Duke Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.NT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Close points on a modular hyperbola
For infinitely many primes p there is a choice of c such that no square of side sqrt(0.1 log p) contains two points, giving a sqrt(log p) lower bound for the guaranteed side length.