An elementary analog of the operator method in additive combinatorics
From MaRDI portal
Publication:2037636
DOI10.1134/S0001434621010132zbMath1468.11035OpenAlexW3180977692MaRDI QIDQ2037636
Publication date: 8 July 2021
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434621010132
Exact enumeration problems, generating functions (05A15) Additive bases, including sumsets (11B13) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (3)
Higher convexity and iterated second moment estimates ⋮ Non-commutative methods in additive combinatorics and number theory ⋮ On sums and products of combinatorial cubes
Cites Work
- On sums of Szemerédi-Trotter sets
- An approximate version of Sidorenko's conjecture
- Higher moments of convolutions
- On popular sums and differences for sets with small multiplicative doubling
- A correlation inequality for bipartite graphs
- Some applications of W. Rudin's inequality to problems of combinatorial number theory
- Some new results on higher energies
- Fourier analysis in combinatorial number theory
- On Sumsets of Convex Sets
- Graph norms and Sidorenko's conjecture
This page was built for publication: An elementary analog of the operator method in additive combinatorics