Krasikov's discrete Laguerre inequality for polynomials

At least 15 years old · documented by

Let L-Pn\mathcal{L}\text{-}\mathcal{P}_n denote the real polynomials of degree nn with only real zeros. For such a polynomial pp, let μ(p)\mu(p) be the minimum spacing between neighboring zeros. Krasikov's conjecture. If p(x)∈L-Pnp(x)\in\mathcal{L}\text{-}\mathcal{P}_n and μ(p)≥1\mu(p)\ge 1, then

(n−1)[p(x+1)−p(x−1)]2−4np(x)[p(x+1)−2p(x)+p(x−1)]≥0(n-1)[p(x+1)-p(x-1)]^2-4np(x)[p(x+1)-2p(x)+p(x-1)]\ge 0

for all x∈Rx\in\mathbb{R}. This discrete analogue of the classical Laguerre inequality is proved in the paper, so the conjecture is solved.

References

Primary source

George Csordas and Matthew Chasse, “Discrete analogues of the Laguerre inequalities and a conjecture of I. Krasikov”, arXiv:1005.5186 (2010).

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.