Farey nets and multidimensional continued fractions

DOI10.1007/BF01572079MaRDI QIDQ1207666zbMATH OpenFDO

Authors David Grabiner

Publication date 12 May 1993

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/178572

zbMATH Keywords

Farey netFarey sequencemultidimensional continued fractionMönkemeyer's algorithmtriangulation

Mathematics Subject Classification ID

Simultaneous homogeneous approximation, linear forms (11J13) Continued fractions and generalizations (11J70) Irrationality; linear independence over a field (11J72)

Review text

The ordinary continued fraction algorithm can be defined using the Farey sequence, approximating a number by the endpoints of intervals which contain it. Analogously, we define a Farey net \(F_{n,m}\) be a triangulation of the set of all vectors \(({a_ 1 \over a_{n+1}},\dots, {a_ n \over a_{n+1}})\) with \(a_{n+1}\leq m\) into simplices of determinant \(\pm 1\), and use this algorithm to define a multidimensional continued fraction for a vector \(\eta\) in which the approximations are the vertices of the simplices containing \(\eta\) in a sequence of Farey nets. The concept of a Farey net was proposed by A. Hurwitz, and R. Mönkemeyer developed a specific continued fraction algorithm based on it. We show that Mönkemeyer's algorithm discovers dependencies among the coordinates of \(\eta\) in two dimensions, but that no continued fraction algorithm based on Farey nets can discover dependencies in three or more dimensions, and none can be strongly convergent (converging faster than a constant multiple of \(1/a_{n+1}\)), even in two dimensions.

Recommendations

• Über Fareynetze in n Dimensionen
• An algorithm for constructing multidimensional continued fractions and linear dependence of numbers
• scientific article; zbMATH DE number 3743363
• A 2-dimensional algorithm related to the Farey-Brocot sequence
• Multidimensional Farey partitions

Cites work

• Farey Triangles and Farey Quadrangels in the Complex Plane.
• Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two
• Geodesic Multidimensional Continued Fractions
• scientific article; zbMATH DE number 3737757 (Why is no real title available?)
• scientific article; zbMATH DE number 3340365 (Why is no real title available?)
• Über die Struktur n-dimensionaler Fareynetze.
• Über Fareynetze in n Dimensionen

Cited in

(14)

• Moments for generalized Farey-Brocot partitions
• Simplex-karyon algorithm of multidimensional continued fraction expansion
• A two-dimensional Minkowski \(?(x)\) function
• Linear-fractional invariance of the simplex-module algorithm for expanding algebraic numbers in multidimensional continued fractions
• Triangles in Diophantine approximation
• Moments for the multidimensional Mönkemeyer algorithm
• A 2-dimensional algorithm related to the Farey-Brocot sequence
• A Canonical Form for Planar Farey Sets
• scientific article; zbMATH DE number 3637736 (Why is no real title available?)
• The \(n\)-dimensional Stern-Brocot tree
• Rational approximations, multidimensional continued fractions, and lattice reduction
• Multidimensional Farey partitions
• Multidimensional continued fractions and a Minkowski function
• Asymptotics for two-dimensional Farey-Brocot nets

This page was built for publication: Farey nets and multidimensional continued fractions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207666)