Finiteness property in Cantor real numeration systems
arXiv:2302.10708
Abstract
For alternate Cantor real base numeration systems we generalize the result of Frougny and~Solomyak on~arithmetics on the set of numbers with finite expansion. We provide a class of alternate bases which satisfy the so-called finiteness property. The proof uses rewriting rules on the~language of~expansions in the corresponding numeration system. The proof is constructive and provides a~method for~performing addition of~expansions in Cantor real bases. We consider a numeration system which is a common generalization of the positional systems introduced by Cantor and Rényi. Number representations are obtained using a composition of -transformations for a given sequence of real bases , . We focus on~arithmetical properties of the set of numbers with finite -expansion in case that is an alternate base, i.e.\ is a periodic sequence. We provide necessary conditions for the so-called finiteness property. We further show a~sufficient condition using rewriting rules on the~language of~representations. The proof is constructive and provides a~method for~performing addition of~expansions in alternate bases. Finally, we give a family of alternate bases that satisfy this sufficient condition. Our work generalizes the results of Frougny and Solomyak obtained for the case when the base is a constant sequence.
19 pages,