ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p(z)p(z) be a polynomial of degree nn, let ρmin⁡:=min⁡ρ:p(ρ)=0∣ρ∣\rho_{\min}:=\min_{\rho:p(\rho)=0}|\rho|, and let LmL_m be the lower bound in the inequality Lm/ρmin⁡≥1−ϵL_m/\rho_{\min}\geq 1-\epsilon. n-independent convergence-rate conjecture. There is a fixed constant cc with

1<c≪21<c\ll 2

such that the inequality holds for m=mcm=m_c, where

mc=O(1ϵc),m_c=O\left(\frac{1}{\epsilon^c}\right),

and mcm_c does not depend on nn. This conjecture refines the experimentally observed rate by asserting independence from the polynomial degree; the paper does not provide a proof, and the exponent and constant remain to be established.

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.