A note on the no-(d+2)-on-a-sphere problem
classification
🧮 math.CO
cs.DM
keywords
fracbestboundconstructcubedimensionalfixedhyperplane
read the original abstract
For fixed $d\geq 3$, we construct subsets of the $d$-dimensional lattice cube $[n]^d$ of size $n^{\frac{3}{d + 1} - o(1)}$ with no $d+2$ points on a sphere or a hyperplane. This improves the previously best known bound of $\Omega(n^{\frac{1}{d-1}})$ due to Thiele from 1995.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Mathematical exploration and discovery at scale
AlphaEvolve rediscovered best-known solutions for most of 67 tested math problems and found improved solutions in several cases using LLM-guided evolutionary search.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.