On sums and products in \(\mathbb C[x]\)

DOI10.1007/s11139-010-9219-4zbMath1253.11014arXiv0812.2286OpenAlexW2128125667MaRDI QIDQ970604

Ernie Croot, Derrick N. 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

Fermat's last theoremMason's theoremsum-productErdős-Szemerédi conjectureABC theorem

Mathematics Subject Classification ID

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

Related Items (2)

Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ New sum-product type estimates over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sum-sets and product-sets of complex numbers
• Bounding multiplicative energy by the sumset
• Sums and products from a finite set of real numbers
• The Erdős-Szemerédi problem on sum set and product set
• 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
• The sum-product phenomenon in arbitrary rings
• Diagonal equations over function fields
• On the number of sums and products
• On the size of $k$-fold sum and product sets of integers
• ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER
• Eine zahlentheoretische Anwendung der Graphentheorie.
• On sums and products of integers

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