A Note on Lyapunov Theory for Brun Algorithm

DOI10.1007/978-3-211-74280-8_21zbMATH Open1197.11097OpenAlexW2145412028MaRDI QIDQ3530444FDOQ3530444

Authors: 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

Recommendations

• Brun meets Selmer
• scientific article; zbMATH DE number 1503600
• The modified Jacobi-Perron algorithm over \(\mathbb F_q (X)^d\)
• 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)
• On almost everywhere strong convergence of multi-dimensional continued fraction algorithms

zbMATH Keywords

metric theory of generalized continued fractions

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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 quality of the diophantine approximations found by the Jacobi--Perron algorithm and related algorithms
• Title not available (Why is that?)
• The exponent of convergence for 2-dimensional Jacobi-Perron type algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Brun meets Selmer
• The Brun gcd algorithm in high dimensions is almost always subtractive
• Title not available (Why is that?)

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

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