Uniform Diophantine approximation and best approximation polynomials
Johannes Schleischitz

TL;DR
This paper introduces a new method using parametric geometry of numbers to bound the uniform approximation exponent of transcendental numbers, improving existing bounds unconditionally and providing stronger conditional bounds.
Contribution
The authors develop a novel approach based on parametric geometry of numbers to derive new bounds for uniform polynomial approximation exponents, both unconditionally and conditionally.
Findings
Unconditional bound: \u2264 2n-2+o(1) for large n
Improved bound over previous results by Bugeaud and the author
Conditional bounds suggest the exponent is smaller than current upper bounds
Abstract
Let be a real transcendental number. We introduce a new method to find upper bounds for the classical exponent concerning uniform polynomial approximation. Our method is based on the parametric geometry of numbers introduced by Schmidt and Summerer, and transference of the original approximation problem in dimension to suitable higher dimensions. For large , we can provide an unconditional bound of order . While this improves the bound of order due to Bugeaud and the author, it is unfortunately slightly weaker than what can be obtained when incorporating a recently proved conjecture of Schmidt and Summerer. However, the method also enables us to establish significantly stronger conditional bound upon a certain presumably weak assumption on the structure of the best approximation…
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.
