Erdős–Turán conjecture for irreducible-in-variables two-variable polynomials

From papers

Let fZ[x,y]f\in\mathbb Z[x,y] be a two-variable polynomial that is not decomposable as

f(x,y)=g(x)h(y),f(x,y)=g(x)h(y),

where g,hZ[x]g,h\in\mathbb Z[x]. Let A,BZ+\mathcal A,\mathcal B\subseteq\mathbb Z^+ be finite sets with AB2|\mathcal A|\geq|\mathcal B|\geq2, and let ωN(n)\omega_{\mathbb N}(n) denote the number of distinct prime divisors of the positive integer nn.

Erdős–Turán conjecture for two-variable polynomials. There exists a constant cc depending only on ff such that

ωN(aA, bBf(a,b))clogA.\omega_{\mathbb N}\left(\prod_{a\in\mathcal A,\ b\in\mathcal B}f(a,b)\right)\geq c\log|\mathcal A|.

This conjecture seeks to generalize the Erdős–Turán theorem from products of sums to products of values of arbitrary two-variable polynomials that do not separate as a product of a polynomial in xx and a polynomial in yy. Its status is not resolved in the supplied source context.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Erik Füredi and Katalin Gyarmati, “Erdős–Turán Theorem and Eulerian Integers”, arXiv:2602.07545 (2026).

Additional references

9 papers in this index state this conjecture (2011–2026). The statement above is taken from the most recent of them; the others are arXiv:2512.08455, arXiv:2010.11857, arXiv:1907.09847, arXiv:1903.09352, arXiv:1710.01195, arXiv:1709.04076, arXiv:1408.1063, arXiv:1101.5851.

Solutions 0

No solutions have been posted yet.