h-Fold Sums from a Set with Few Products

DOI10.1137/090756041MaRDI QIDQ5392906zbMATH OpenOpenAlexFDO

Authors Ernie Croot, Derrick Hart

Publication date 15 April 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0904.0718

zbMATH Keywords

additive combinatoricsErdős-Szemerédi conjecturesum-product inequalitiesTarry-Escott problem

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Other combinatorial number theory (11B75) Distribution functions associated with additive and positive multiplicative functions (11N60)

Abstract: In the present paper we show that if A is a set of n real numbers, and the product set A.A has at most n^(1+c) elements, then the k-fold sumset kA has at least n^(log(k/2)/2 log 2 + 1/2 - f_k(c)) elements, where f_k(c) -> 0 as c -> 0. We believe that the methods in this paper might lead to a much stronger result; indeed, using a result of Trevor Wooley on Vinogradov's Mean Value Theorem and the Tarry-Escott Problem, we show that if |A.A| < n^(1+c), then |k(A.A)| > n^(Omega((k/log k)^(1/3))), for c small enough in terms of k (we believe that a certain modification of this argument can perhaps produce similar conclusions for kA).

Recommendations

• New results on sums and products in \(\mathbb{R}\)
• Sums and products with smooth numbers
• Sum and product of different sets
• On the size of k-fold sum and product sets of integers
• On an additive-number-theoretic problem of P. Erdős
• A sum--product theorem in semi-simple commutative Banach algebras
• On a problem of Erdős and Sárközy
• An update on the sum-product problem
• On consecutive sums in sequences
• Sum-product inequalities with perturbation

Cited in

(15)

• Sums and products from a finite set of real numbers
• Factorization in generalized arithmetic progressions and application to the Erdős-Szemerédi sum-product problems
• On multiple sum and product sets of finite sets of integers.
• New results on the Erdős-Szemerédi sum-product problems.
• Vinogradov's mean value theorem via efficient congruencing. II
• Higher convexity and iterated sum sets
• h-fold sums from a set with few products
• Vinogradov's mean value theorem via efficient congruencing
• Few products, many h-fold sums
• On the Multiplicity of the Zeros of Polynomials with Constrained Coefficients
• On higher energy decompositions and the sum-product phenomenon
• Sums and products with smooth numbers
• Polynomials with multiple roots at 1
• Sum and product of different sets
• Pseudo-Boolean functions and the multiplicity of the zeros of polynomials

This page was built for publication: h-Fold Sums from a Set with Few Products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5392906)