ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For f∈Z[T]f\in\mathbb{Z}[T], define τ(f)\tau(f) as the least kk for which ff occurs in a sequence beginning with f−1(T)=1f_{-1}(T)=1 and f0(T)=Tf_0(T)=T, with each later polynomial obtained from two earlier ones by addition, subtraction, or multiplication. Let Z(f)Z(f) be the number of distinct integer zeros of ff. The τ\tau-conjecture. There is a constant c>0c>0 such that

Z(f)≤(1+τ(f))cZ(f)\leq(1+\tau(f))^c

for every f∈Z[T]f\in\mathbb{Z}[T]. This conjecture would imply that the 20 Questions problem is not in polynomial time; its status is open in the source.

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.