Papers
Topics
Authors
Recent
2000 character limit reached

Large grid subsets without many cospherical points (2506.18113v1)

Published 22 Jun 2025 in math.CO and math.AG

Abstract: Motivated by intuitions from projective algebraic geometry, we provide a novel construction of subsets of the $d$-dimensional grid $[n]d$ of size $n - o(n)$ with no $d + 2$ points on a sphere or a hyperplane. For $d = 2$, this improves the previously best known lower bound of $n/4$ toward the Erd\H{o}s--Purdy problem due to Thiele in 1995. For $d \ge 3$, this improves the recent $\Omega \bigl( n{\frac{3}{d+1}-o(1)} \bigr)$ bound due to Suk and White, confirming their conjectured $\Omega \bigl( n{\frac{d}{d+1}} \bigr)$ bound in a strong sense, and asymptotically resolves the generalized Erd\H{o}s--Purdy problem posed by Brass, Moser, and Pach.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.