On badly approximable vectors (Q2137862): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00209-021-02939-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4207018182 / rank | |||
Normal rank |
Revision as of 02:07, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On badly approximable vectors |
scientific article |
Statements
On badly approximable vectors (English)
0 references
11 May 2022
0 references
The deep results of this paper were motivated by the result of \textit{N. A. Van Nguyen} et al. [J. Théor. Nombres Bordx. 32, No. 2, 387--402 (2020; Zbl 1460.11100)] where a powerful method was introduced. The authors describe badly approximable numbers, their relation with the continued fraction algorithm and also intruduce the concept in higher dimensions. A criterion is given for a vector \(\alpha\in\mathbb R^d\) to be a badly approximable vector. The authors show that a more general version of their criterion is not valid. A corresponding new result is also announced on best approximations in the sense of a linear form. In Section 4, propositions on the ordinary Diophantine exponent and the uniform Diophantine exponent are formulated.
0 references
Diophantine approximation
0 references
badly approximable vectors
0 references
best approximations
0 references
Diophantine exponent
0 references