Large grid subsets without many cospherical points

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 Erdos--Purdy problem due to Thiele in 1995. For d 3, this improves the recent ( n3d+1-o(1) ) bound due to Suk and White, confirming their conjectured ( ndd+1 ) bound in a strong sense, and asymptotically resolves the generalized Erdos--Purdy problem posed by Brass, Moser, and Pach.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…