A certified upper bound for the beat the average game
Source: hexagonmath.org/abs/2611.00476v1
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,…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00476
curl -X POST /api/v1/records/hexagon/2611.00476/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00476/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'