Some new inequalities in additive combinatorics
arXiv:1208.2344
Abstract
In the paper we find new inequalities involving the intersections of shifts of some subset from an abelian group. We apply the inequalities to obtain new upper bounds for the additive energy of multiplicative subgroups and convex sets and also a series another results on the connection of the additive energy and so--called higher moments of convolutions. Besides we prove new theorems on multiplicative subgroups concerning lower bounds for its doubling constants, sharp lower bound for the cardinality of sumset of a multiplicative subgroup and its subprogression and another results.
39 pages
References in corpus (2)
Cited by in corpus (10)
- Energies and structure of additive sets
- On sums of Szemerédi--Trotter sets
- Any small multiplicative sugroup is not a sumset
- Incomplete exponential sums over exponential functions
- Exponential sums with sparse polynomials over finite fields
- Additive energy of cyclic matrix groups and character sums with matrix exponential functions
- Improving cardinality estimation of sums of sets with convexity
- On tripling constant of multiplicative subgroups
- Sumsets of the distance set in
- On the exponential large sieve inequality for sparse sequences modulo primes