A note on the no-$(d+2)$-on-a-sphere problem
Andrew Suk, Ethan Patrick White

TL;DR
This paper constructs large subsets within a d-dimensional lattice cube that avoid having d+2 points on a sphere or hyperplane, improving previous bounds and advancing understanding of geometric configurations in discrete spaces.
Contribution
The authors provide a new construction of large point sets in high-dimensional cubes avoiding certain geometric configurations, surpassing earlier known bounds.
Findings
Constructed subsets of size approximately n^{3/(d+1)} with no d+2 points on a sphere or hyperplane
Improved the lower bound from (n^{1/(d-1)}) to n^{3/(d+1)}
Advances the understanding of extremal configurations in discrete geometry
Abstract
For fixed , we construct subsets of the -dimensional lattice cube of size with no points on a sphere or a hyperplane. This improves the previously best known bound of due to Thiele from 1995.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
