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 Introduction to Diophantine Approximation

2015 ◽  
Vol 23 (2) ◽  
pp. 101-106
Author(s):  
Yasushige Watase
Keyword(s):  
Real Number ◽  
Diophantine Approximation ◽  
Continued Fractions ◽  
Irrational Number ◽  
Integer Solution ◽  
Infinitely Many Solutions

Abstract In this article we formalize some results of Diophantine approximation, i.e. the approximation of an irrational number by rationals. A typical example is finding an integer solution (x, y) of the inequality |xθ − y| ≤ 1/x, where 0 is a real number. First, we formalize some lemmas about continued fractions. Then we prove that the inequality has infinitely many solutions by continued fractions. Finally, we formalize Dirichlet’s proof (1842) of existence of the solution [12], [1].

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 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 A NOTE ON WEIGHTED BADLY APPROXIMABLE LINEAR FORMS

2016 ◽  
Vol 59 (2) ◽  
pp. 349-357 ◽  
Author(s):  
STEPHEN HARRAP ◽  
NIKOLAY MOSHCHEVITIN
Keyword(s):  
Diophantine Approximation ◽  
Affirmative Answer ◽  
Famous Conjecture ◽  
Linear Forms ◽  
Badly Approximable

AbstractWe prove a result in the area of twisted Diophantine approximation related to the theory of Schmidt games. In particular, under certain restrictions we give an affirmative answer to the analogue in this setting of a famous conjecture of Schmidt from Diophantine approximation.

scholarly journals A mass transference principle for systems of linear forms and its applications

2018 ◽  
Vol 154 (5) ◽  
pp. 1014-1047 ◽  
Author(s):  
Demi Allen ◽  
Victor Beresnevich
Keyword(s):  
Lebesgue Measure ◽  
Diophantine Approximation ◽  
Hausdorff Measure ◽  
Linear Forms ◽  
Transference Principle ◽  
Integer Points ◽  
Additional Constraints

In this paper we establish a general form of the mass transference principle for systems of linear forms conjectured in 2009. We also present a number of applications of this result to problems in Diophantine approximation. These include a general transference of Lebesgue measure Khintchine–Groshev type theorems to Hausdorff measure statements. The statements we obtain are applicable in both the homogeneous and inhomogeneous settings as well as allowing transference under any additional constraints on approximating integer points. In particular, we establish Hausdorff measure counterparts of some Khintchine–Groshev type theorems with primitivity constraints recently proved by Dani, Laurent and Nogueira.

scholarly journals Fibonacci Numbers with a Prescribed Block of Digits

Mathematics ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 639 ◽  
Author(s):  
Pavel Trojovský
Keyword(s):  
Lower Bounds ◽  
Diophantine Approximation ◽  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Algebraic Numbers ◽  
Decimal Expansion ◽  
Linear Forms

In this paper, we prove that F 22 = 17711 is the largest Fibonacci number whose decimal expansion is of the form a b … b c … c . The proof uses lower bounds for linear forms in three logarithms of algebraic numbers and some tools from Diophantine approximation.

scholarly journals Diophantine approximation by continued fractions

1991 ◽  
Vol 51 (2) ◽  
pp. 324-330 ◽  
Author(s):  
Jingcheng Tong
Keyword(s):  
Diophantine Approximation ◽  
Continued Fractions ◽  
Continued Fraction ◽  
Irrational Number ◽  
Continued Fraction Expansion ◽  
Image Position

AbstractLet ξ be an irrational number with simple continued fraction expansion be its ith convergent. Let Mi = [ai+1,…, a1]+ [0; ai+2, ai+3,…]. In this paper we prove that Mn−1 < r and Mn R imply which generalizes a previous result of the author.

On Diophantine approximations of the solutions of q-functional equations

2002 ◽  
Vol 132 (3) ◽  
pp. 639-659 ◽  
Author(s):  
Tapani Matala-aho
Keyword(s):  
Lower Bound ◽  
Vector Space ◽  
Linear Independence ◽  
Number Fields ◽  
Growth Conditions ◽  
Linear Forms ◽  
Dimension Estimate ◽  
Linearly Independent ◽  
Diophantine Approximations ◽  
Image Position

Given a sequence of linear forms in m ≥ 2 complex or p-adic numbers α1, …,αm ∈ Kv with appropriate growth conditions, Nesterenko proved a lower bound for the dimension d of the vector space Kα1 + ··· + Kαm over K, when K = Q and v is the infinite place. We shall generalize Nesterenko's dimension estimate over number fields K with appropriate places v, if the lower bound condition for |Rn| is replaced by the determinant condition. For the q-series approximations also a linear independence measure is given for the d linearly independent numbers. As an application we prove that the initial values F(t), F(qt), …, F(qm−1t) of the linear homogeneous q-functional equation where N = N(q, t), Pi = Pi(q, t) ∈ K[q, t] (i = 1, …, m), generate a vector space of dimension d ≥ 2 over K under some conditions for the coefficient polynomials, the solution F(t) and t, q ∈ K*.

Integer Farkas Lemma

2015 ◽  
Vol 17 (01) ◽  
pp. 1540003 ◽  
Author(s):  
R. Chandrasekaran
Keyword(s):  
Nonnegative Integer ◽  
Original System ◽  
Single Equation ◽  
Integer Solution ◽  
Polynomial Algorithms ◽  
Inequality System ◽  
Farkas Lemma ◽  
Single Constraint ◽  
Nonnegative Solutions ◽  
Integer Solutions

Farkas type results are available for solutions to linear systems. These can also include restrictions such as nonnegative solutions or integer solutions. They show that the unsolvability can be reduced to a single constraint that is not solvable and this condition is implied by the original system. Such a result does not exist for integer solution to inequality system because a single inequality is always solvable in integers. But a single equation that does not have nonnegative integer solution exists. We present some cases when polynomial algorithms to find nonnegative integer solutions exist.

scholarly journals METRICAL RESULTS ON SYSTEMS OF SMALL LINEAR FORMS

2013 ◽  
Vol 09 (03) ◽  
pp. 769-782 ◽  
Author(s):  
M. HUSSAIN ◽  
S. KRISTENSEN
Keyword(s):  
Diophantine Approximation ◽  
Hausdorff Measure ◽  
Linear Forms ◽  
Approximation Function

In this paper the metric theory of Diophantine approximation associated with the small linear forms is investigated. Khintchine–Groshev theorems are established along with Hausdorff measure generalization without the monotonic assumption on the approximation function.

Sign in / Sign up

Export Citation Format

Share Document