Improved Upper Bounds for Slicing the Hypercube

Researchers have improved upper bounds for cutting hypercubes with hyperplanes. The study proves that S(n) ≤ ⌈4n/5⌉ hyperplanes suffice to intersect all edges of an n-dimensional hypercube, improving on a 1971 bound of ⌈5n/6⌉. The breakthrough uses CPro1, an AI tool combining reasoning large language models with automated hyperparameter tuning to discover mathematical constructions efficiently.