Preview

Chebyshevskii Sbornik

Advanced search

FROM DIOPHANTINE APPROXIMATIONS TO DIOPHANTINE EQUATIONS

https://doi.org/10.22405/2226-8383-2016-17-3-38-52

Abstract

Let in the real \(n\)-dimensional space \(\mathbb{R}^n=\{X\}\) be given \(m\) real homogeneous forms \(f_i(X)\), \(i=1,\dotsc,m\), \(2\leqslant m\leqslant n\). The convex hull of the set of points \(G(X)=(|f_1(X)|,\dotsc,|f_m(X)|)\) for integer \(X\in\mathbb Z^n\) in many cases is a convex polyhedral set. Its boundary for \(||X||<\mathrm{const}\) can be computed by means of the standard program. The points \(X\in\mathbb Z^n\) are called boundary points if \(G(X)\) lay on the boundary. They correspond to the best Diophantine approximations \(X\) for the given forms. That gives the global generalization of the continued fraction. For \(n=3\) Euler, Jacobi, Dirichlet, Hermite, Poincar\'e, Hurwitz, Klein, Minkowski, Brun, Arnold and a lot of others tried to generalize the continued fraction, but without a succes.

Let \(p(\xi)\) be an integer real irreducible in \(\mathbb Q\) polynomial of the order \(n\) and \(\lambda\) be its root. The set of fundamental units of the ring \(\mathbb Z[\lambda]\) can be computed using boundary points of some set of linear and quadratic forms, constructed by means of the roots of the polynomial \(p(\xi)\). Similary one can compute a set of fundamental units of other rings of the field \(\mathbb Q(\lambda)\). Up today such sets of fundamental units were computed only for \(n=2\) (using usual continued fractions) and \(n=3\) (using the Voronoi algorithms).

Our approach generalizes the continued fraction, gives the best rational simultaneous approximations, fundamental units of algebraic rings of the field \(\mathbb Q(\lambda)\) and all solutions of a certain class of Diophantine equations for any \(n\).

About the Author

A. D. Bruno
Keldysh Institute of Applied Mathematics RAS
Russian Federation
doctor of physico-mathematical Sciences, professor


References

1. Khinchin, A. Ya. 1963, Continued fractions, Noordhoff, Groningen.

2. Bruno, A. D. 1964, “The expansion of algebraic numbers into continued fractions”, USSR Comp. Math. Math. Phys., Vol. 4, no. 2, Pp. 1–15.

3. Bruno, A. D. 2010, “New generalizations of continued fraction. I”, Functiones et Approximatio. vol. 43, no. 1. Pp. 55–104.

4. Bruno, A. D. 2014, On geometric methods in works by V. I. Arnold and V. V. Kozlov, Preprint of arXiv, No 1401.6320.

5. Bruno, A. D. 2015, “Universal generalization of the continued fraction algorithm”, Chebyshevsky sbornik, vol. 16, no. 2, pp. 35–65.

6. Voronoi, G. F. 1896, On Generalization of the Algorithm of Continued Fraction, Warsawa University.

7. Bruno, A. D. 2010, “The structure of multidimensional Diophantine approximations”, Doklady Mathematics, vol. 82, no. 1. Pp. 587–589.

8. Bruno, A. D. 2010, “Structure of the best diophantine approximations and multidimensional generalizations of the continued fraction”, Chebyshevsky sbornik, vol. 11, no. 1, pp. 68–73.

9. Fukuda, K. 2008, “Exact algorithms and software in optimization and polyhedral computation”, Proceed. ISSAC’08 of XXI International Symposium on Symbolic and Algebraic Computations, ACM NY, USA, Pp. 333–334.

10. Barber, C. B. & Dobkin, D. P. & Huhdanpaa, H. T. 1996, “The Quickhull algorithm for convex hulls”, ACM Trans. on Mathematical Software, 22(4):469–483, http://www.qhull.org.

11. Borevich, ZI & Shafarevich, IR 1966, Number Theory, Academic Press.

12. Bruno, A. D. & Parusnikov, V. I. 2003, “Polyhedra of absolute values for triple of linear forms”, Preprint no. 93 of the Keldysh Inst. of Applied Math., Moscow. URL: http://library.keldysh.ru/preprint.asp?id=2003-93.

13. Bruno, A. D. 2006, “Generalization of continued fraction”, Chebyshevsky sbornik, vol. 7, no. 3, pp. 4–71.

14. Parusnikov, V. I. 2011, “4-dimensional generalization of the continued fractions”, Preprint no. 78 of the Keldysh Inst. of Applied Math., Moscow. URL: http://library.keldysh.ru/preprint.asp?id=2011-78.

15. Bruno, A. D. 2016, “From Diophantine approximations to Diophantine equations”, Preprint no. 1 of the Keldysh Inst. of Applied Math., Moscow. URL: http://library.keldysh.ru/preprint.asp?id=2016-1

16. Bruno, A. D. 2016, “Computation of the best Diophantine approximations and the fundamental units of the algebraic fields”, Doklady Mathematics, vol. 93, no. 3. Pp. 243–247.


Review

For citations:


Bruno A.D. FROM DIOPHANTINE APPROXIMATIONS TO DIOPHANTINE EQUATIONS. Chebyshevskii Sbornik. 2016;17(3):38-52. (In Russ.) https://doi.org/10.22405/2226-8383-2016-17-3-38-52

Views: 648


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 2226-8383 (Print)