Answers are grounded in this paper and cite their sources.
Let n be a positive integer and ξ a transcendental real number. We are interested in bounding from above the uniform exponent of polynomial approximation ω ^ n (ξ). Davenport and Schmidt's original 1969 inequality ω ^ n (ξ)≤2n-1 was improved recently, and the best upper bound known to date is 2n-2 for each n≥10. In this paper, we develop new techniques leading us to the improved upper bound 2n-1 3n 1/3 +𝒪(1).
No takes yet. Share an insight, caveat, or question.
Anthony Poëls (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: