A discrete weighted Markov--Bernstein inequality for polynomials and sequences
Dimitar K. Dimitrov, Geno P. Nikolov

TL;DR
This paper establishes bounds and asymptotic behavior for discrete Markov-Bernstein inequalities in weighted sequence spaces, linking constants to eigenvalues of Jacobi matrices, and extends results to polynomial spaces.
Contribution
It provides new bounds and asymptotic limits for Markov-Bernstein inequalities in weighted discrete and polynomial spaces, connecting constants to eigenvalues of Jacobi matrices.
Findings
(n,c,1) 1 + 1/ for all n, with limit as n 1 + 1/.
(n,c,) decreases monotonically with in (0,).
Constants (n,c,) are uniformly bounded in n for fixed c and .
Abstract
For parameters and , let be the Hilbert space of real functions defined on (i.e., real sequences), for which We study the best (i.e., the smallest possible) constant in the discrete Markov-Bernstein inequality where is the set of real algebraic polynomials of degree at most and . We prove that: (i) for every and . (ii) For every fixed , is a monotonically…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Iterative Methods for Nonlinear Equations · Advanced Numerical Analysis Techniques
