scholarly journals Efficient computing of n-dimensional simultaneous Diophantine approximation problems

2013 ◽  
Vol 5 (1) ◽  
pp. 16-34 ◽  
Author(s):  
Attila Kovács ◽  
Norbert Tihanyi
Keyword(s):  
Diophantine Approximation ◽  
Irrational Number ◽  
Solution Set ◽  
Simultaneous Diophantine Approximation ◽  
Diophantine Approximations ◽  
Algorithmic Problems ◽  
Simultaneous Diophantine Approximations ◽  
Approximation Problems ◽  
Full Solution

Abstract In this paper we consider two algorithmic problems of simultaneous Diophantine approximations. The first algorithm produces a full solution set for approximating an irrational number with rationals with common denominators from a given interval. The second one aims at finding as many simultaneous solutions as possible in a given time unit. All the presented algorithms are implemented, tested and the PariGP version made publicly available.

scholarly journals Introduction to Diophantine Approximation. Part II

2017 ◽  
Vol 25 (4) ◽  
pp. 283-288
Author(s):  
Yasushige Watase
Keyword(s):  
Diophantine Approximation ◽  
Irrational Number ◽  
Basic Result ◽  
Formal Proof ◽  
Integer Solution ◽  
Linear Forms ◽  
Diophantine Approximations ◽  
Integer Solutions ◽  
System 1 ◽  
Hurwitz Theorem

SummaryIn the article we present in the Mizar system [1], [2] the formalized proofs for Hurwitz’ theorem [4, 1891] and Minkowski’s theorem [5]. Both theorems are well explained as a basic result of the theory of Diophantine approximations appeared in [3], [6]. A formal proof of Dirichlet’s theorem, namely an inequation |θ−y/x| ≤ 1/x2has infinitely many integer solutions (x, y) where θ is an irrational number, was given in [8]. A finer approximation is given by Hurwitz’ theorem: |θ− y/x|≤ 1/√5x2. Minkowski’s theorem concerns an inequation of a product of non-homogeneous binary linear forms such that |a1x + b1y + c1| · |a2x + b2y + c2| ≤ ∆/4 where ∆ = |a1b2− a2b1| ≠ 0, has at least one integer solution.

scholarly journals Best Diophantine approximations to a set of linear forms

1983 ◽  
Vol 34 (1) ◽  
pp. 114-122 ◽  
Author(s):  
J. C. Lagarias
Keyword(s):  
Diophantine Approximation ◽  
Linear Form ◽  
Best Approximation ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Linear Forms ◽  
Simultaneous Diophantine Approximation ◽  
Diophantine Approximations ◽  
Necessary And Sufficient ◽  
Infinite Set

AbstractWe define the notion of a best Diophantine approximation vector to a set of linear forms. This generalizes definitions of a best approximation vector to a single linear form and of a best simultaneous Diophantine approximation vector. We derive necessary and sufficient conditions for the existence of an infinite set of best Diophantine approximation vectors. Finally, we prove that such approximation vectors are spaced far apart in an appropriate sense.

scholarly journals KHINTCHINE'S THEOREM AND TRANSFERENCE PRINCIPLE FOR STAR BODIES

2006 ◽  
Vol 02 (03) ◽  
pp. 431-453
Author(s):  
M. M. DODSON ◽  
S. KRISTENSEN
Keyword(s):  
Distance Function ◽  
Diophantine Approximation ◽  
Direct Proof ◽  
Distance Functions ◽  
Transference Principle ◽  
Simultaneous Diophantine Approximation ◽  
Star Bodies

Analogues of Khintchine's Theorem in simultaneous Diophantine approximation in the plane are proved with the classical height replaced by fairly general planar distance functions or equivalently star bodies. Khintchine's transference principle is discussed for distance functions and a direct proof for the multiplicative version is given. A transference principle is also established for a different distance function.

Sign in / Sign up

Export Citation Format

Share Document