On uniform polynomial approximation
Anthony Po\"els

TL;DR
This paper improves the upper bounds on the uniform polynomial approximation exponent for transcendental real numbers, introducing new techniques that tighten previous bounds from 2n-2 to approximately 2n minus a fractional correction.
Contribution
The authors develop novel methods to refine the upper bounds on the uniform polynomial approximation exponent, surpassing previous results for all sufficiently large n.
Findings
Established an improved upper bound of approximately 2n - (1/3)n^{1/3} + O(1).
Extended the understanding of polynomial approximation exponents for transcendental numbers.
Provided new techniques that could influence future research in Diophantine approximation.
Abstract
Let be a positive integer and a transcendental real number. We are interested in bounding from above the uniform exponent of polynomial approximation . Davenport and Schmidt's original 1969 inequality was improved recently, and the best upper bound known to date is for each . In this paper, we develop new techniques leading us to the improved upper bound .
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 · Matrix Theory and Algorithms
