Summary: ·
1.
10 {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} 10
Pisot
2. Pisot
> 1 x
x =

i=N0
a-i-i
ai [0, ) Z
(G) N N0 x -
N
i=N0
a-i-i
< -N
greedy condition

(F) Fin() = Z[1/]0
Fin()

Source: Akiyama, Shigeki - Department of Mathematics, Niigata University

Collections: Mathematics