Arithmetic combinatorics on Vinogradov systems
From MaRDI portal
Publication:3298972
DOI10.1090/TRAN/8121zbMATH Open1480.11018arXiv2001.08312OpenAlexW3008568095MaRDI QIDQ3298972FDOQ3298972
Authors: Akshat Mudgal
Publication date: 17 July 2020
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Abstract: In this paper, we present a variant of the Balog-Szemer'edi-Gowers theorem for the Vinogradov system. We then use our result to deduce a higher degree analogue of the sum-product phenomenon.
Full work available at URL: https://arxiv.org/abs/2001.08312
Recommendations
Arithmetic combinatorics; higher degree uniformity (11B30) Additive number theory; partitions (11P99)
Cites Work
- Additive combinatorics
- On the size of $k$-fold sum and product sets of integers
- Translation invariance, exponential sums, and Waring's problem
- Few sums, many products
- Bounding multiplicative energy by the sumset
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Title not available (Why is that?)
- New bounds in Balog-Szemerédi-Gowers theorem
- Proof of the main conjecture in Vinogradov's mean value theorem for degrees higher than three
- On a question of Erdős and Moser
- A statistical theorem of set addition
- Nested efficient congruencing and relatives of Vinogradov's mean value theorem
- The Vinogradov mean value theorem [after Wooley, and Bourgain, Demeter and Guth]
- Many additive quadruples
- On higher energy decompositions and the sum-product phenomenon
- On a certain generalization of the Balog-Szemerédi-Gowers theorem
Cited In (1)
This page was built for publication: Arithmetic combinatorics on Vinogradov systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3298972)