Ergodic and Diophantine properties of algorithms of Selmer type

DOI10.4064/AA114-2-1zbMATH Open1122.11048OpenAlexW1982493292MaRDI QIDQ4811269FDOQ4811269

Authors: Fritz Schweiger 

Publication date: 18 August 2004

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: http://journals.impan.gov.pl/aa/Inf/114-2-1.html

Recommendations

• The convergence of the generalised Selmer algorithm
• Selmer's multiplicative algorithm
• Absorbing sets of homogeneous subtractive algorithms
• Periodic multiplicative algorithms of Selmer type
• Convergence for Selmer's algorithm

Mathematics Subject Classification ID

Simultaneous homogeneous approximation, linear forms (11J13) Continued fractions and generalizations (11J70) Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Measure-preserving transformations (28D05)

Cited In (9)

• Selmer's multiplicative algorithm
• Convergence for Selmer's algorithm
• Periodic multiplicative algorithms of Selmer type
• Title not available (Why is that?)
• On the second Lyapunov exponent of some multidimensional continued fraction algorithms
• Multidimensional continued fractions and symbolic codings of toral translations
• The convergence of the generalised Selmer algorithm
• Zero measure spectrum for multi-frequency Schrödinger operators
• Lebesgue ergodicity of a dissipative subtractive algorithm

This page was built for publication: Ergodic and Diophantine properties of algorithms of Selmer type

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