## Bernat, Julien - Arithmetics in β-numeration

dmtcs:389 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 1
Arithmetics in β-numeration

Authors: Bernat, Julien

The β-numeration, born with the works of Rényi and Parry, provides a generalization of the notions of integers, decimal numbers and rational numbers by expanding real numbers in base β, where β>1 is not an integer. One of the main differences with the case of numeration in integral base is that the sets which play the role of integers, decimal numbers and rational numbers in base β are not stable under addition or multiplication. In particular, a fractional part may appear when one adds or multiplies two integers in base β. When β is a Pisot number, which corresponds to the most studied case, the lengths of the finite fractional parts that may appear when one adds or multiplies two integers in base β are bounded by constants which only depend on β. We prove that, for any Perron number β, the set of finite or ultimately periodic fractional parts of the sum, or the product, of two integers in base β is finite. Additionally, we prove that it is possible to compute this set for the case of addition when β is a Parry number. As a consequence, we deduce that, when β is a Perron number, there exist bounds, which only depend on β, for the lengths of the finite fractional parts that may appear when one adds or multiplies two integers in base β. Moreover, when β is a Parry number, the bound associated with the case of addition can be explicitly computed.

Source : oai:HAL:hal-00966511v1
Volume: Vol. 9 no. 1
Section: Analysis of Algorithms
Published on: January 1, 2007
Submitted on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]