A Note on Lyapunov Theory for Brun Algorithm

DOI10.1007/978-3-211-74280-8_21zbMath1197.11097OpenAlexW2145412028MaRDI QIDQ3530444

Fritz Schweiger

Publication date: 20 October 2008

Published in: Diophantine Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-211-74280-8_21

zbMATH Keywords

metric theory of generalized continued fractions

Mathematics Subject Classification ID

Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Continued fractions and generalizations (11J70)

Related Items (1)

The Brun gcd algorithm in high dimensions is almost always subtractive

Cites Work

• The quality of the diophantine approximations found by the Jacobi--Perron algorithm and related algorithms
• The Jacobi-Perron algorithm its theory and application
• Exposants caractéristiques de l'algorithme de Jacobi-Perron et de la transformation associée. (Characteristic exponents of the Jacobi-Perron algorithm and of the associated map)
• The exponent of convergence for 2-dimensional Jacobi-Perron type algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Note on Lyapunov Theory for Brun Algorithm