Absorbing sets of homogeneous subtractive algorithms

DOI10.1007/S00605-012-0385-XzbMATH Open1337.11052arXiv1104.3762OpenAlexW2594638999MaRDI QIDQ714968FDOQ714968

Authors: T. Miernowski, Arnaldo Nogueira 

Publication date: 15 October 2012

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Abstract: We consider homogeneous multidimensional continued fraction algorithms, in particular a family of maps which was introduced by F. Schweiger. We prove his conjecture regarding the existence of an absorbing set for those maps. We also establish that their renormalisations are nonergodic which disproves another conjecture due to Schweiger. Other homogeneous algorithms are also analysed including ones which are ergodic.

Full work available at URL: https://arxiv.org/abs/1104.3762

Recommendations

• On Schweiger's problems on fully subtractive algorithms
• The convergence of the generalised Selmer algorithm
• scientific article; zbMATH DE number 936784
• Lebesgue ergodicity of a dissipative subtractive algorithm
• Convergence of continued fraction type algorithms and generators

zbMATH Keywords

ergodic theorymultidimensional continued fractionsabsorbing set

Mathematics Subject Classification ID

Metric theory of continued fractions (11K50)

Cites Work

• Gauss measures for transformations on the space of interval exchange maps
• Title not available (Why is that?)
• Ergodic properties of a dynamical system arising from percolation theory
• Weak mixing for interval exchange transformations and translation flows
• Échanges d'intervalles et transformations induites
• Ergodic properties of triangle partitions
• The three-dimensional Poincaré continued fraction algorithm
• The Metric Theory of Interval Exchange Transformations III. The Sah-Arnoux-Fathi Invariant
• Dynamics for rotation pseudogroups
• On Schweiger's problems on fully subtractive algorithms
• Infinite clusters and critical values in two-dimensional circle percolation
• Topological weak-mixing of interval exchange maps

Cited In (5)

• Ergodic and Diophantine properties of algorithms of Selmer type
• On Schweiger's problems on fully subtractive algorithms
• The convergence of the generalised Selmer algorithm
• Lebesgue ergodicity of a dissipative subtractive algorithm
• Invariant simplices for subtractive algorithms

This page was built for publication: Absorbing sets of homogeneous subtractive algorithms

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