Lower Bound for the Discrete Norm of a Polynomial on the Circle
V. N. Dubinin

TL;DR
This paper establishes a new lower bound for the discrete norm of polynomials evaluated on the circle, advancing understanding of polynomial behavior in discrete settings.
Contribution
It introduces a novel lower bound for the discrete norm of polynomials on the circle, improving upon previous bounds.
Findings
New lower bound derived for polynomial discrete norms
Enhanced understanding of polynomial behavior on the circle
Potential applications in approximation theory
Abstract
We give a new lower bound for the discrete norm of a polynomial on the circle
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 Approximation and Integration · Matrix Theory and Algorithms · Algebraic and Geometric Analysis
