2018
DOI: 10.48550/arxiv.1802.03081
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

An optimal bound for the ratio between ordinary and uniform exponents of Diophantine approximation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
26
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 9 publications
(26 citation statements)
references
References 0 publications
0
26
0
Order By: Relevance
“…), which is valid for all totally irrational ξ ξ ξ ∈ R n . This result was proven in [26], and a short and beautiful proof was given recently in [28].…”
Section: Badly Approximable Subspacesmentioning
confidence: 75%
“…), which is valid for all totally irrational ξ ξ ξ ∈ R n . This result was proven in [26], and a short and beautiful proof was given recently in [28].…”
Section: Badly Approximable Subspacesmentioning
confidence: 75%
“…Proof. In fact, this lemma follows from inequality (59) of Lemma 10 from [3]. For the sake of completeness we give here a proof.…”
Section: On Diophantine Exponentsmentioning
confidence: 90%
“…As it was discovered by V. Jarník [11], the first trivial inequality here can be improved. The optimal lowed bound for ω(α α α) in terms of ω(α α α) was obtained in [3] where the authors solve a problem by W.M. Schmidt and L. Summerer [10].…”
Section: On Diophantine Exponentsmentioning
confidence: 99%
See 1 more Smart Citation
“…However, refinements in the constant term were made first by Bugeaud and Schleischitz [5]. The proof strategy in [5], in the light of later findings [19,12], in turn yields slightly stronger bounds, in particular w n (ξ) ≤ 2n − 2 for n ≥ 10. See also [21], where a conjectural bound of order (1 + 1/ √ 2)n − o(1) < 1.71n was motivated as well.…”
Section: Other Classical Exponents Of Approximationmentioning
confidence: 99%