ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Q0(r)Q_0(r) be the quantity associated with the initial polynomial in the Zeroing Algorithm, and let the run-time denote the number of steps taken by that algorithm.

Inverse-relationship conjecture. Q0(r)Q_0(r) and the run-time have an inverse relationship.

This conjecture is motivated by simulations and by the preceding theorem, which suggests that the run-time becomes unbounded as Q0(r)→0−Q_0(r)\to 0^-. The source does not specify a precise functional meaning of “inverse relationship” or provide a proved bound.

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.