Metraipolis › archive › dc_cd00bf50491d
A Refined Sum-Product Estimate via Higher Energies — arXiv:2609.25711
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.25711
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T15:55:53.851Z
- SHA-256 of the archived text
557b90cc04e6245cef9621003dbdeb9e3343237c3dd1d05fdaef9bfd404c849b- Stable URL of this page
https://metraipolis.com/documento/dc_cd00bf50491d
How to cite
A Refined Sum-Product Estimate via Higher Energies — arXiv:2609.25711 — arXiv (en), https://arxiv.org/abs/2609.25711 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cd00bf50491d (Metraipolis archive dc_cd00bf50491d, sha256 557b90cc04e6245cef9621003dbdeb9e3343237c3dd1d05fdaef9bfd404c849b)
BibTeX
@misc{dccd00bf50491d,
title = {A Refined Sum-Product Estimate via Higher Energies — arXiv:2609.25711},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.25711},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cd00bf50491d; sha256 557b90cc04e6245cef9621003dbdeb9e3343237c3dd1d05fdaef9bfd404c849b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25711. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $A\subset\mathbb{R}$ be a finite set. Combining the multiplicative slope estimate of Rudnev--Stevens, Cushman's higher-energy regularization, Shakan's $d^+$--$d^\times$ decomposition, and Solymosi's classical sum--product estimate, we prove \[ |AA|^{204}|A+A|^{301}\gtrsim |A|^{675}, \] where $\gtrsim$ suppresses a fixed polylogarithmic factor in $|A|$. Consequently, for every $\varepsilon>0$, \[ \max\{|A+A|,|AA|\}\gg_\varepsilon |A|^{135/101-\varepsilon}. \] The proof is organized around two intermediate estimates. For every nonempty finite set $B\subset\mathbb{R}_{>0}$, \[ d^\times(B)|BB|^{12}|B+B|^{16}\gtrsim |B|^{38}, \] whereas for every nonempty finite set $U\subset\mathbb{R}$, \[ d^+(U)^{17}|U+U|^{29}\gtrsim |U|^{46}. \]
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.25711 — 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-08T15:16:21.677Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).