Article Dans Une Revue Theoretical Computer Science Année : 2011

Redundancy of minimal weight expansions in Pisot bases

Résumé

Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer $n$ as a sum $n=\sum_k \varepsilon_k U_k$, where the digits $\varepsilon_k$ are taken from a finite alphabet $\Sigma$ and $(U_k)_k$ is a linear recurrent sequence of Pisot type with $U_0=1$. The most prominent example of a base sequence $(U_k)_k$ is the sequence of Fibonacci numbers. We prove that the representations of minimal weight $\sum_k|\varepsilon_k|$ are recognised by a finite automaton and obtain an asymptotic formula for the average number of representations of minimal weight. Furthermore, we relate the maximal order of magnitude of the number of representations of a given integer to the joint spectral radius of a certain set of matrices.

Fichier principal
Vignette du fichier
redundant.pdf (275.9 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00572575 , version 1 (01-03-2011)

Licence

Identifiants

Citer

Peter J. Grabner, Wolfgang Steiner. Redundancy of minimal weight expansions in Pisot bases. Theoretical Computer Science, 2011, 412 (45), pp.6303-6315. ⟨10.1016/j.tcs.2011.08.018⟩. ⟨hal-00572575⟩
147 Consultations
141 Téléchargements

Altmetric

Partager

  • More