An Improvement to the Upper Bound for Marton's Covering Conjecture

Source abstract

Marton's covering conjecture studies finite sets in high-dimensional binary spaces whose pairwise sums create relatively few new elements. It predicts that every such set can be described efficiently by shifted copies of one linear subspace of comparable size. Gowers, Green, Manners, and Tao [GGMT25] proved the conjecture with exponent $12$. Liao [L24] improved the exponent to $9$. We improve it further to $8.873$.