5 citations · 12 across the 9 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2020★ 1 cited
V Tree -- Continued Fraction Expansion, Stern-Brocot Tree, Minkowski's Function In Binary: Exponentially Faster
Michael Vielhaber
The Stern-Brocot tree and Minkowki's question mark function (or Conway's box function) are related to the continued fraction expansion of numbers from Q with unary encoding…
math.NT2007★ 2 cited
Moments for generalized Farey-Brocot partitions
Nikolai Moshchevitin, Michael Vielhaber
We generalize the Farey-Brocot partition to a twodimensional continued fraction algorithm and generalized Farey-Brocot nets. We give an asymptotic formula for the moments of order…
math.NT2007★ 1 cited
On an Improvement of a Result by Niederreiter and Wang Concerning the Expected Linear Complexity of Multisequences
Nikolai Moshchevitin, Michael Vielhaber
We show that the expected value for the linear complexity of -multisequences of length is E_n^{(m)} = n m/(m+1) + O(1).