Arithmetic combinatorics on Vinogradov systems
From MaRDI portal
Publication:3298972
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3834055 (Why is no real title available?)
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A statistical theorem of set addition
- Additive combinatorics
- Bounding multiplicative energy by the sumset
- Few sums, many products
- Many additive quadruples
- Nested efficient congruencing and relatives of Vinogradov's mean value theorem
- New bounds in Balog-Szemerédi-Gowers theorem
- On a certain generalization of the Balog-Szemerédi-Gowers theorem
- On a question of Erdős and Moser
- On higher energy decompositions and the sum-product phenomenon
- On the size of $k$-fold sum and product sets of integers
- Proof of the main conjecture in Vinogradov's mean value theorem for degrees higher than three
- The Vinogradov mean value theorem [after Wooley, and Bourgain, Demeter and Guth]
- Translation invariance, exponential sums, and Waring's problem
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)