Lebesgue Ergodicity of a Dissipative Subtractive Algorithm

DOI10.1007/978-1-4939-0419-8_6zbMath1315.37003OpenAlexW114472310WikidataQ59184750 ScholiaQ59184750MaRDI QIDQ5259673

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

Mathematics Subject Classification ID

Ergodicity, mixing, rates of mixing (37A25)

Related Items (1)

The convergence of the generalised Selmer algorithm

Cites Work

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

This page was built for publication: Lebesgue Ergodicity of a Dissipative Subtractive Algorithm