{"id":"hexagon/2611.00476","pdf":"https://hexagonmath.org/pdf/2611.00476v1","url":"https://hexagonmath.org/abs/2611.00476v1","tags":["math.OC","math.CO","msc:60E15","msc:90C22","msc:52C35","msc:68V05","msc:68V20"],"score":0,"title":"A certified upper bound for the beat the average game","domain":"math.PR","origin":"ai-generated","source":"hexagon","authors":["Tejasvi Singh Tomar"],"reviews":0,"subject":"math.PR","summary":"Let $C$ be the supremum of $\\mathbb{P}[X_1+X_2+X_3<2X_4]$ over all probability measures on $[0,\\infty)$, where $X_1,\\dots,X_4$ are independent with the given law. Determining $C$ is Problem 6.39, the beat the average game, in the list of Georgiev, Gómez-Serrano, Tao and Wagner. Bellec and Fritz proved $0.4006953\\le C\\le 673/1615$ and conjectured that the lower bound, $0.4006953723\\ldots$, is the exact value. We prove $C\\le0.40069634$, less than $10^{-6}$ above the conjectured value. The proof applies Razborov's flag algebra method to samples of nine points. Since the points are independent,…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-15","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}