On sums and products in C[x]

DOI10.1007/S11139-010-9219-4MaRDI QIDQ970604zbMATH OpenOpenAlexFDO

Authors Ernie Croot, Derrick Hart

Publication date 19 May 2010

Published in The Ramanujan Journal (Search for Journal in Brave)

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

zbMATH Keywords

ABC theoremErdős-Szemerédi conjectureFermat's last theoremMason's theoremsum-product

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Polynomials in number theory (11C08)

Abstract: We show that under the assumption of a 24-term version of Fermat's Last Theorem, there exists an absolute constant c > 0 such that if S is a set of n > n_0 positive integers satisfying |S.S| < n^(1+c), then the sumset S.S satisfies |S+S| >> n^2. In other words, we prove a weak form of the Erdos-Szemeredi sum-product conjecture, conditional on an extension of Fermat's Last Theorem. Unconditionally, we prove this theorem for when S is a set of n monic polynomials. We also prove an analogue of a theorem of Bourgain and Chang for the ring C[x].

Review text

The authors prove that there exists an absolute constant \(c>0\) such that if \(A\) is a set of \(n\) monic polynomials, and if the product set \(A\). \(A\) has at most \(n^{1+c}\) elements, then \(|A+A|\gg n^2\). This can be thought of as step towards proving the Erdős-Szemerédi sum-product conjecture for polynomial rings. They also show that under a suitable generalization of Fermat's Last Theorem, the same result holds for the integers. The methods they use to prove are a mixture of algebraic (e.g. Mason's theorem) and combinatorial (e.g. the Ruzsa-Plünnecke inequality) techniques.

Recommendations

• New results on the Erdős-Szemerédi sum-product problems.
• ON THE NUMBER OF SUMS AND PRODUCTS
• Sums versus products
• Sum-product theorems in algebraic number fields
• The Erdős-Szemerédi problem on sum set and product set

Cites work

• A generalization of Mason's theorem for four polynomials
• A new bound for an extension of Mason's theorem for functions of several variables
• A sum-product estimate in finite fields, and applications
• Bounding multiplicative energy by the sumset
• Diagonal equations over function fields
• Eine zahlentheoretische Anwendung der Graphentheorie.
• ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER
• scientific article; zbMATH DE number 3845662 (Why is no real title available?)
• scientific article; zbMATH DE number 36206 (Why is no real title available?)
• scientific article; zbMATH DE number 95509 (Why is no real title available?)
• scientific article; zbMATH DE number 2115025 (Why is no real title available?)
• On sum-sets and product-sets of complex numbers
• On sums and products of integers
• On the number of sums and products
• On the size of k-fold sum and product sets of integers
• Sum and product of different sets
• Sums and products from a finite set of real numbers
• The Erdős-Szemerédi problem on sum set and product set
• The sum-product phenomenon in arbitrary rings

Cited in

(2)

• New sum-product type estimates over finite fields
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition

This page was built for publication: On sums and products in \(\mathbb C[x]\)

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