Abstract
Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer as a sum , where the digits are taken from a finite alphabet and is a linear recurrent sequence of Pisot type with . The most prominent example of a base sequence is the sequence of Fibonacci numbers. We prove that the representations of minimal weight 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.