On sets of large exponential sums
From MaRDI portal
Abstract: Let A be a subset of Z / NZ, and let R be the set of large Fourier coefficients of A. Properties of R have been studied in works of M.-C. Chang and B. Green. Our result is the following : the number of quadruples (r_1, r_2, r_3, r_4) in R^4 such that r_1 + r_2 = r_3 + r_4 is at least |R|^{2+epsilon}, epsilon>0. This statement shows that the set R is highly structured. We also discuss some of the generalizations and applications of our result.
Recommendations
Cites work
- scientific article; zbMATH DE number 3425719 (Why is no real title available?)
- A polynomial bound in Freiman's theorem.
- Arithmetic progressions in sumsets
- Generalized arithmetical progressions and sumsets
- Integer Sum Sets Containing Long Arithmetic Progressions
- Linear equations over \(\mathbb F_ p\) and moments of exponential sums.
- Some Constructions in the Inverse Spectral Theory of Cyclic Groups
Cited in
(10)- On sumsets and spectral gaps
- EXPONENTIAL LENGTH OF CERTAIN SEQUENCES OF SUBSETS
- On the subset sums of exponential type sequences
- On sets of large Fourier transform under changes in domain
- On certain other sets of integers
- Covering the large spectrum and generalized Riesz products
- On sets of large trigonometric sums
- The number of squares and \(B_h[g]\) sets
- On sumsets of dissociated sets
- Exponential sums running over particular sets of positive integers
This page was built for publication: On sets of large exponential sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q610521)