“…), 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].…”
We generalize Khintchine's method of constructing totally irrational singular vectors and linear forms. The main result of the paper shows existence of totally irrational vectors and linear forms with large uniform Diophantine exponents on certain subsets of R n , in particular on any analytic submanifold of R n of dimension ≥ 2 which is not contained in a proper rational affine subspace.
“…), 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].…”
We generalize Khintchine's method of constructing totally irrational singular vectors and linear forms. The main result of the paper shows existence of totally irrational vectors and linear forms with large uniform Diophantine exponents on certain subsets of R n , in particular on any analytic submanifold of R n of dimension ≥ 2 which is not contained in a proper rational affine subspace.
“…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%
“…We use a standard trick which reduces the problem for linear forms to the problem for simultaneous approximation. This trick was used in [3], Section 5.2.…”
Motivated by a wonderful paper [7] where a powerful method was introduced, we prove a criterion for a vector α α α ∈ R d to be a badly approximable vector. Moreover we construct certain examples which show that a more general version of our criterion is not valid.
“…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
We improve the lower bound for the classical exponent of approximation w * n (ξ) connected to Wirsing's famous problem of approximation to real numbers by algebraic numbers of degree at most n. Our bound exceeds n/ √ 3 ≈ 0.5773n and thus provides a reasonable qualitative improvement to previous bounds of order n/2 + O(1). We further establish new relations between several classical exponents of approximation.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.