On sums and products in \(\mathbb C[x]\) (Q970604): Difference between revisions

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.