2025/06/02 by Fan Zheng, Zheng, Fan
Computer Science · #Advanced Algebra and Logic #Combinatorics (math.CO) #Constraint Satisfaction and Optimization #FOS: Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2506.01896
openalex publication_date 2025/06/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present a new advancement in the sum and difference of sets problem, which improves upon recent results by both DeepMind's AlphaEvolve (θ= 1.1584) and subsequent explicit constructions (θ= 1.173050). In this work, we construct a sequence of U sets which in the limit establishes a new lower bound of θ= 1.173077.