Metraipolis › archive › dc_f3d3da2e07fe
An Improvement to the Upper Bound for Marton's Covering Conjecture — arXiv:2608.30336
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.30336
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T09:31:10.378Z
- SHA-256 of the archived text
e010a1fc8094d7c066dd214996f95f6d64f2c51c7b176b03cde3aa6abffbdaa9- Stable URL of this page
https://metraipolis.com/documento/dc_f3d3da2e07fe
How to cite
An Improvement to the Upper Bound for Marton's Covering Conjecture — arXiv:2608.30336 — arXiv (en), https://arxiv.org/abs/2608.30336 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f3d3da2e07fe (Metraipolis archive dc_f3d3da2e07fe, sha256 e010a1fc8094d7c066dd214996f95f6d64f2c51c7b176b03cde3aa6abffbdaa9)
BibTeX
@misc{dcf3d3da2e07fe,
title = {An Improvement to the Upper Bound for Marton's Covering Conjecture — arXiv:2608.30336},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.30336},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f3d3da2e07fe; sha256 e010a1fc8094d7c066dd214996f95f6d64f2c51c7b176b03cde3aa6abffbdaa9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30336. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 $5.287$. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.30336 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T09:02:28.850Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).