The convergence of the generalised Selmer algorithm
DOI10.1007/s11856-015-1237-xzbMath1332.11072OpenAlexW2230778605WikidataQ59184739 ScholiaQ59184739MaRDI QIDQ891184
Henk Bruin, Cornelis Kraaikamp, Robbert J. Fokkink
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
subtractive algorithmergodic probability measuremultidimensional continuous fractionsSelmer algorithm
Measure-preserving transformations (28D05) Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Ergodicity, mixing, rates of mixing (37A25) Metric theory of continued fractions (11K50)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- The quality of the diophantine approximations found by the Jacobi--Perron algorithm and related algorithms
- Absorbing sets of homogeneous subtractive algorithms
- Recurrence times and rates of mixing
- 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
- Invariant simplices for subtractive algorithms
- Variations of the Poincaré Map
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- 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
- Lebesgue Ergodicity of a Dissipative Subtractive Algorithm
- 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)
This page was built for publication: The convergence of the generalised Selmer algorithm