A Short Proof of the Existence of Vector Euclidean Algorithms

DOI10.2307/2046068MaRDI QIDQ3720673zbMATH OpenOpenAlexFDO

Authors Helaman Ferguson

Publication date 1986

Full work available at URL https://doi.org/10.2307/2046068

zbMATH Keywords

independencelinear dependencelinear relationssimultaneous approximationsvector Euclidean algorithm

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Continued fractions and generalizations (11J70) Algebraic independence; Gel'fond's method (11J85) Simultaneous approximation (41A28)

Recommendations

• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• scientific article; zbMATH DE number 1186951
• scientific article; zbMATH DE number 653582
• scientific article; zbMATH DE number 45475
• scientific article; zbMATH DE number 3980478

Cites work

• Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two
• scientific article; zbMATH DE number 3745287 (Why is no real title available?)

Cited in

(3)

• Models of discriminant surfaces
• Numerical results on relations between fundamental constants using a new algorithm
• Another note on “Euclidean algorithms are Gaussian” by V. Baladi and B. Vallée

This page was built for publication: A Short Proof of the Existence of Vector Euclidean Algorithms

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