Uniform Diophantine approximation and best approximation polynomials
From MaRDI portal
Publication:4963285
DOI10.4064/AA170901-4-7zbMATH Open1473.11141arXiv1709.00499OpenAlexW2963809034WikidataQ129426733 ScholiaQ129426733MaRDI QIDQ4963285FDOQ4963285
Authors: Johannes Schleischitz
Publication date: 1 November 2018
Published in: Acta Arithmetica (Search for Journal in Brave)
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 polynomials. Thereby we provide serious evidence that the exponent should be reasonably smaller than the known upper bounds.
Full work available at URL: https://arxiv.org/abs/1709.00499
Recommendations
Simultaneous homogeneous approximation, linear forms (11J13) Lattices and convex bodies (number-theoretic aspects) (11H06)
Cites Work
Cited In (9)
- An equivalence principle between polynomial and simultaneous Diophantine approximation
- SIMULTANEOUS APPROXIMATION TO TWO REALS: BOUNDS FOR THE SECOND SUCCESSIVE MINIMUM
- On uniform polynomial approximation
- On uniform approximation to real numbers
- Going-up theorems for simultaneous Diophantine approximation
- On geometry of numbers and uniform rational approximation to the Veronese curve
- On the discrepancy between best and uniform approximation
- Some notes on the regular graph defined by Schmidt and Summerer and uniform approximation
- An improved bound in Wirsing's problem
This page was built for publication: Uniform Diophantine approximation and best approximation polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963285)