Improved Upper Bounds for Slicing the Hypercube
Duncan Soiffer, Nathaniel Itty, Christopher D. Rosin, Blake Bruell, Mason DiCicco, Gábor N. Sárközy, Ryan Offstein, Daniel Reichman
AI use, as the source states it
“We prove the improved upper bound on S(n) by constructing 8 hyperplanes slicing Q_{10} aided by the recently introduced CPro1: an automatic tool that uses reasoning LLMs coupled with automated hyperparameter tuning to create search algorithms for the discovery of mathematical constructions.”
Model: CPro1, as stated
Named here, or see a mistake? Write to privacy@papex.org.