Large grid subsets without many cospherical points

TL;DR

This paper constructs large subsets of high-dimensional grids avoiding many cospherical points, improving bounds for the Erdős–Purdy problem and confirming conjectures in combinatorial geometry.

Contribution

It introduces a novel construction method for grid subsets with no many cospherical points, advancing bounds and resolving longstanding conjectures.

Findings

For d=2, improves lower bound from n/4 to near n.

For d≥3, confirms the conjectured Ω(n^{d/(d+1)}) bound.

Asymptotically resolves the generalized Erdős–Purdy problem.

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.