Matching works

2 works

math.PR — Probability

A certified upper bound for the beat the average game

Contributed by Tejasvi Singh Tomar

Let CC be the supremum of P[X1+X2+X3<2X4]\mathbb{P}[X_1+X_2+X_3<2X_4] over all probability measures on [0,∞)[0,\infty), where X1,…,X4X_1,\dots,X_4 are independent with the given law. Determining CC 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≤C≤673/16150.4006953\le C\le 673/1615 and conjectured that the lower bound, 0.4006953723…0.4006953723\ldots, is the exact value. We prove C≤0.40069634C\le0.40069634, less than 10−610^{-6} above the conjectured value. The proof applies Razborov's flag algebra method to samples of nine points. Since the points are independent, the positivity constraints of flag algebras hold for every single measure, so that no limit objects are needed. An exact certificate is checked in rational arithmetic, and the bound is also proved in the Lean 4 proof assistant, with Lean's kernel checking the certificate.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715999

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202612 pages
PDFView work

math.CO — Combinatorics

Constructions and explicit power savings for point--unit-circle incidences

Contributed by Yuda Chen, Yifei Wang

Let U(n,m)\mathcal U(n,m) be the maximum number of incidences between nn distinct points and mm distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing s=min⁡(n,m)s=\min(n,m) and M=max⁡(n,m)M=\max(n,m), the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent 1.0411699201.041169920. The second gives balanced configurations along an unbounded sequence with exponent 1.04317223055397011.0431722305539701, and further unbalanced configurations. The upper bound is U(n,m)≪M+s2/3−2δM2/3+δ\mathcal U(n,m)\ll M+s^{2/3-2\delta}M^{2/3+\delta}, where δ=2−2664/514560000000>2−2665\delta=2^{-2^{664}}/514560000000>2^{-2^{665}}. The constructions use two windows in a relative-norm-one number-field lattice, strengthened arithmetic estimates, and interpolation between local profiles. The upper bound uses finite incidence regularization, prediction, arithmetic heights, and a six-by-five rigidity obstruction. The resulting bounds for the unit-distance problem follow as corollaries.

Primarily AI-generated textHuman understanding: some partsPoint--unit-circle incidencesarithmetic heightsclass field towersincidence boundsnumber-field latticespolynomial partitioningunit distances
Nov 15, 2026178 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations