Petr Ambrož ; Zuzana Masáková ; Edita Pelantová - Addition and multiplication of beta-expansions in generalized Tribonacci base

dmtcs:394 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 2 -
Addition and multiplication of beta-expansions in generalized Tribonacci base

Authors: Petr Ambrož 1; Zuzana Masáková 1; Edita Pelantová ORCID-iD1

  • 1 Doppler Institute/ Department of Mathematics

We study properties of β-numeration systems, where β > 1 is the real root of the polynomial x3 - mx2 - x - 1, m ∈ ℕ, m ≥ 1. We consider arithmetic operations on the set of β-integers, i.e., on the set of numbers whose greedy expansion in base β has no fractional part. We show that the number of fractional digits arising under addition of β-integers is at most 5 for m ≥ 3 and 6 for m = 2, whereas under multiplication it is at most 6 for all m ≥ 2. We thus generalize the results known for Tribonacci numeration system, i.e., for m = 1. We summarize the combinatorial properties of infinite words naturally defined by β-integers. We point out the differences between the structure of β-integers in cases m = 1 and m ≥ 2.

Volume: Vol. 9 no. 2
Published on: January 1, 2007
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1051/ita:2004014
  • 10.1051/ita:2004014
  • 10.1051/ita:2004014
Corrigendum : “Complexity of infinite words associated with beta-expansions”

Consultation statistics

This page has been seen 209 times.
This article's PDF has been downloaded 177 times.