Relations de récurrence linéaires, primitivité et loi de Benford

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages; title updated, theorem 2 completed

Scientific paper

We prove that many sequences of positive numbers $(a_n)$ defined by finite
linear difference equations $a_{n+k}=c_{k-1}a_{n+k-1}+...+c_0a_n$ with suitable
non negative reals coefficients $c_i$ satisfy Bendford's Law on the first digit
in many bases $b>2$. Our techniques rely on Perron-Frobenius theory via the
companion matrix of the characteristic polynomial of the defining equation.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Relations de récurrence linéaires, primitivité et loi de Benford 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 Relations de récurrence linéaires, primitivité et loi de Benford, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relations de récurrence linéaires, primitivité et loi de Benford will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-139337

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.