ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f∈Z[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,h∈Z[x]g,h\in\mathbb Z[x]. Let A,B⊆Z+\mathcal A,\mathcal B\subseteq\mathbb Z^+ be finite sets with ∣A∣≥∣B∣≥2|\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(∏a∈A, b∈Bf(a,b))≥clog⁡∣A∣.\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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.