Redundancy of minimal weight expansions in Pisot bases

Details Redundancy of minimal weight expansions in Pisot bases Redundancy of minimal weight expansions in Pisot bases

2011-03-01

arxiv.org/abs/1103.0267v1

Mathematics

Number Theory

Scientific paper

Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer $n$ as a sum $n=\sum_k \epsilon_k U_k$, where the digits $\epsilon_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|\epsilon_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.

Affiliated with

Also associated with

No associations

Rating

Redundancy of minimal weight expansions in Pisot bases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Redundancy of minimal weight expansions in Pisot bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Redundancy of minimal weight expansions in Pisot bases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471985