ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a straight-line program for a polynomial in one variable be a list

s0=1,s1=x,s2,…,sτ,s_0=1,\quad s_1=x,\quad s_2,\ldots,s_{\tau},

where each sis_i, for i≥2i\geq 2, is one of sj+sks_j+s_k, sj−sks_j-s_k, or sjsks_js_k for some j,k<ij,k<i. For f∈Z[x]f\in\mathbb Z[x], let τ(f)\tau(f) be the least length of a straight-line program computing ff, and let n(f)n(f) denote the number of distinct integer zeros of ff. Integer-zero bound conjecture. There is a constant a>0a>0 such that, for every univariate polynomial f∈Z[x]f\in\mathbb Z[x],

n(f)<τ(f)a.n(f)<\tau(f)^a.

Such a bound would connect the arithmetic complexity of straight-line programs with the number of integer roots and is presented in the context of complexity over C\mathbb C and the separation of polynomial-time and nondeterministic polynomial-time computation.

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.