Higher convexity and iterated second moment estimates
From MaRDI portal
Publication:2153401
DOI10.37236/10773OpenAlexW3158390334MaRDI QIDQ2153401
Peter Bradshaw, Brandon Hanson, Michael Rudnev
Publication date: 4 July 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.11330
Other combinatorial number theory (11B75) Exponential sums (11T23) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Additive bases, including sumsets (11B13)
Related Items (2)
Convexity, squeezing, and the Elekes-Szabó theorem ⋮ On some applications of GCD sums to arithmetic combinatorics
Cites Work
- Combinatorial complexity of convex sequences
- On consecutive sums in sequences
- Convexity and sumsets
- An elementary analog of the operator method in additive combinatorics
- On sum sets and convex functions
- Higher convexity and iterated sum sets
- On the energy variant of the sum-product conjecture
- On the few products, many sums problem
- Additive properties of slowly increasing convex sets
- Some new results on higher energies
- On Sumsets of Convex Sets
- Convexity and a sum-product type estimate
- On the size of $k$-fold sum and product sets of integers
- Few products, many h-fold sums
- On asymptotic formulae in some sum–product questions
- SUM-PRODUCT ESTIMATES FOR DIAGONAL MATRICES
- On lower bounds for the \(L_1\)-norm of exponential sums
- Unnamed Item
- Unnamed Item
This page was built for publication: Higher convexity and iterated second moment estimates
