Conjecture on an n-independent convergence rate for Kalantari's bound

At least 5 years old · documented by

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.

References

Primary source

Matt Hohertz, “A constructive proof of the convergence of Kalantari's bound on polynomial zeros”, arXiv:2012.02150 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.