Math-4121 · mathematics · Graph theory

Math-4121

Conjecture 3.26

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Shared notation.
$\mathbb N=\{1,2,\ldots\}$, and $\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$ denote the integers, rationals, reals and complex numbers. Any other conventions are specified locally.

Let $P\in\mathbb Z[X,Y]$ be irreducible in $\mathbb Q(X)[Y]$ and of positive $Y$-degree. Set $d=\deg P$ and $H(P)=\max|a_{ij}|$ for its integer coefficients. An admissible specialization is a positive integer $n$ for which $P(n,Y)$ is irreducible in $\mathbb Q[Y]$.

Statement recorded in the supplied source.
Is there a polynomial bound $B(d,H)$, uniform over these $P$, such that an admissible $n\le B(d,H(P))$ always exists? [S2]

Short English statement

Can one always find a positive irreducible specialization within a bound polynomial in the polynomial degree and coefficient height?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.