On Schweiger's problems on fully subtractive algorithms
From MaRDI portal
Publication:1758958
DOI10.1007/s11856-011-0140-3zbMath1273.11119OpenAlexW2021300673MaRDI QIDQ1758958
Hitoshi Nakada, Robbert J. Fokkink, Cornelis Kraaikamp
Publication date: 19 November 2012
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-011-0140-3
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
The convergence of the generalised Selmer algorithm ⋮ Invariant simplices for subtractive algorithms ⋮ Absorbing sets of homogeneous subtractive algorithms ⋮ Analysis of generalized continued fraction algorithms over polynomials ⋮ Lebesgue Ergodicity of a Dissipative Subtractive Algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fine and Wilf words for any periods
- Infinite clusters and critical values in two-dimensional circle percolation
- 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: On Schweiger's problems on fully subtractive algorithms
