The convergence of the generalised Selmer algorithm
DOI10.1007/S11856-015-1237-XzbMATH Open1332.11072OpenAlexW2230778605WikidataQ59184739 ScholiaQ59184739MaRDI QIDQ891184FDOQ891184
Authors: Henk Bruin, Robbert Fokkink, Cor Kraaikamp 
Publication date: 16 November 2015
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-015-1237-x
Recommendations
ergodic probability measuresubtractive algorithmmultidimensional continuous fractionsSelmer algorithm
Ergodicity, mixing, rates of mixing (37A25) Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Measure-preserving transformations (28D05) Metric theory of continued fractions (11K50)
Cites Work
- Recurrence times and rates of mixing
- Title not available (Why is that?)
- Ergodic properties of a dynamical system arising from percolation theory
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- 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
- The three-dimensional Poincaré continued fraction algorithm
- On Schweiger's problems on fully subtractive algorithms
- Infinite clusters and critical values in two-dimensional circle percolation
- Absorbing sets of homogeneous subtractive algorithms
- Invariant simplices for subtractive algorithms
- Variations of the Poincaré map
- Title not available (Why is that?)
- An algorithm for calculating critical probabilities and percolation functions in percolation models defined by rotations
- Lebesgue ergodicity of a dissipative subtractive algorithm
Cited In (11)
- Selmer's multiplicative algorithm
- Brun meets Selmer
- Erratum to: ``The convergence of the generalised Selmer algorithm
- Convergence for Selmer's algorithm
- Absorbing sets of homogeneous subtractive algorithms
- Periodic multiplicative algorithms of Selmer type
- Ergodic and Diophantine properties of algorithms of Selmer type
- Analysis of generalized continued fraction algorithms over polynomials
- On the second Lyapunov exponent of some multidimensional continued fraction algorithms
- Multidimensional continued fractions and symbolic codings of toral translations
- On Schweiger's problems on fully subtractive algorithms
This page was built for publication: The convergence of the generalised Selmer algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891184)
