Farey nets and multidimensional continued fractions (Q1207666): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic Multidimensional Continued Fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über Fareynetze in <i>n</i> Dimensionen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Struktur n-dimensionaler Fareynetze. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farey Triangles and Farey Quadrangels in the Complex Plane. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616951 / rank
 
Normal rank

Latest revision as of 15:58, 17 May 2024

scientific article
Language Label Description Also known as
English
Farey nets and multidimensional continued fractions
scientific article

    Statements

    Farey nets and multidimensional continued fractions (English)
    0 references
    0 references
    0 references
    12 May 1993
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    Farey sequence
    0 references
    Farey net
    0 references
    triangulation
    0 references
    multidimensional continued fraction
    0 references
    Mönkemeyer's algorithm
    0 references