On sumsets of dissociated sets
From MaRDI portal
Publication:3565417
Abstract: In the paper we are studying some properties of subsets Q of sums of dissociated sets. The exact upper bound for the number of solutions of the following equation (1) q_1 + ... + q_p = q_{p+1} + ... + q_{2p}, q_i in Q in groups F_2^n is found. Using our approach, we easily prove a recent result of J. Bourgain on sets of large exponential sums and obtain a tiny improvement of his theorem. Besides an inverse problem is considered in the article. Let Q be a set belonging a sumset of two dissociated sets such that equation (1) has many solutions. We prove that in the case the large proportion of Q is highly structured.
Recommendations
Cited in
(11)- Higher moments of convolutions
- An application of the sum-product phenomenon to sets avoiding several linear equations
- When Sets Are Not Sum-dominant
- Distribution of residues in approximate subgroups of \(\mathbb F_p^*\)
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Improved bound in Roth's theorem on arithmetic progressions
- On certain other sets of integers
- On the indecomposability of amalgamated sums
- On sets of large trigonometric sums
- A short remark on the multiplicative energy of the spectrum
- On the size of dissociated bases
This page was built for publication: On sumsets of dissociated sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565417)