Ostrowski numeration
In mathematics, Ostrowski numeration, named after Alexander Ostrowski, is either of two related numeration systems based on continued fractions: a non-standard positional numeral system for integers and a non-integer representation of real numbers.
Fix a positive irrational number α with continued fraction expansion [a0; a1, a2, ...]. Let (qn) be the sequence of denominators of the convergents pn/qn to α: so qn = anqn−1 + qn−2. Let αn denote Tn(α) where T is the Gauss map T(x) = {1/x}, and write βn = (−1)n+1 α0 α1 ... αn: we have βn = anβn−1 + βn−2.
Real number representations
Every positive real x can be written as
- [math]\displaystyle{ x = \sum_{n=1}^\infty b_n \beta_n \ }[/math]
where the integer coefficients 0 ≤ bn ≤ an and if bn = an then bn−1 = 0.
Integer representations
Every positive integer N can be written uniquely as
- [math]\displaystyle{ N = \sum_{n=1}^k b_n q_n \ }[/math]
where the integer coefficients 0 ≤ bn ≤ an and if bn = an then bn−1 = 0.
If α is the golden ratio, then all the partial quotients an are equal to 1, the denominators qn are the Fibonacci numbers and we recover Zeckendorf's theorem on the Fibonacci representation of positive integers as a sum of distinct non-consecutive Fibonacci numbers.
See also
References
- Allouche, Jean-Paul; Shallit, Jeffrey (2003). Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press. ISBN 978-0-521-82332-6..
- Epifanio, C.; Frougny, C.; Gabriele, A.; Mignosi, F.; Shallit, J. (2012). "Sturmian graphs and integer representations over numeration systems". Discrete Appl. Math. 160 (4-5): 536–547. doi:10.1016/j.dam.2011.10.029. ISSN 0166-218X.
- Ostrowski, Alexander (1921). "Bemerkungen zur Theorie der diophantischen Approximationen" (in German). Hamb. Abh. 1: 77–98.
- Pytheas Fogg, N. (2002). Substitutions in dynamics, arithmetics and combinatorics. Lecture Notes in Mathematics. 1794. Berlin: Springer-Verlag. ISBN 3-540-44141-7.
 |  |
