2022
DOI: 10.1112/mtk.12148
|View full text |Cite
|
Sign up to set email alerts
|

Upper bounds for the uniform simultaneous Diophantine exponents

Abstract: We give several upper bounds for the uniform simultaneous Diophantine exponent λ̂n(ξ)$\widehat{\lambda }_n(\xi )$ of a transcendental number ξ∈double-struckR$\xi \in \mathbb {R}$. The most important one relates λ̂n(ξ)$\widehat{\lambda }_n(\xi )$ and the ordinary simultaneous exponent ωk(ξ)$\omega _k(\xi )$ in the case when k is substantially smaller than n. In particular, in the generic case ωk(ξ)=k$\omega _k(\xi )=k$ with a properly chosen k, the upper bound for λ̂n(ξ)$\widehat{\lambda }_n(\xi )$ becomes as s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 16 publications
(63 reference statements)
0
3
0
Order By: Relevance
“…For even n, the author improved the bound from [5] in [16,17]. Then in a very recent paper Badziahin [1] improved on the previous results for n ≥ 4, which in turn has been refined by Poels and Roy [11] to constitute the currently best known bounds for λ n (ξ). In private communication, D. Roy pointed out to me that he recently obtained a very small improvement on his result [13] for n = 3, in a paper in preparation.…”
mentioning
confidence: 93%
See 2 more Smart Citations
“…For even n, the author improved the bound from [5] in [16,17]. Then in a very recent paper Badziahin [1] improved on the previous results for n ≥ 4, which in turn has been refined by Poels and Roy [11] to constitute the currently best known bounds for λ n (ξ). In private communication, D. Roy pointed out to me that he recently obtained a very small improvement on his result [13] for n = 3, in a paper in preparation.…”
mentioning
confidence: 93%
“…The polynomial P (1) minimizes L P over all relevant choices of P , hence L 1 (q) = min L P (q) = min max log H P − q 2n − 2 , log |P (ξ)| + q with minimum taken over all non-zero integer polynomials P of degree at most 2n − 2.…”
Section: Parametric Geometry Of Numbers: Introduction and A Lemmamentioning
confidence: 99%
See 1 more Smart Citation