Lebesgue ergodicity of a dissipative subtractive algorithm

DOI10.1007/978-1-4939-0419-8_6zbMATH Open1315.37003OpenAlexW114472310WikidataQ59184750 ScholiaQ59184750MaRDI QIDQ5259673FDOQ5259673

Authors: Henk Bruin 

Publication date: 29 June 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4939-0419-8_6

Recommendations

• On Schweiger's problems on fully subtractive algorithms
• scientific article; zbMATH DE number 936784
• Ergodic and Diophantine properties of algorithms of Selmer type
• Absorbing sets of homogeneous subtractive algorithms
• scientific article; zbMATH DE number 827363

Mathematics Subject Classification ID

Ergodicity, mixing, rates of mixing (37A25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Ergodic properties of a dynamical system arising from percolation theory
• Title not available (Why is that?)
• The three-dimensional Poincaré continued fraction algorithm
• Exactness and maximal automorphic factors of unimodal interval maps.
• On Schweiger's problems on fully subtractive algorithms
• Infinite clusters and critical values in two-dimensional circle percolation
• Absorbing sets of homogeneous subtractive algorithms
• An algorithm for calculating critical probabilities and percolation functions in percolation models defined by rotations

Cited In (2)

• On Schweiger's problems on fully subtractive algorithms
• The convergence of the generalised Selmer algorithm

This page was built for publication: Lebesgue ergodicity of a dissipative subtractive algorithm

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