Generalised Fibonacci sequences constructed from balanced words
From MaRDI portal
Abstract: We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference of the two preceding terms where the pluses and minuses follow a certain pattern. In 2012, McLellan proved that if the pluses and minuses follow a periodic pattern and is the th term of the resulting generalised Fibonacci sequence, then �egin{equation*} lim_{n
ightarrowinfty}|G_n|^{1/n} end{equation*} exists. We extend her results to recurrences of the form if the choices of pluses and minuses, and of the follow a balancing word type pattern.
Recommendations
Cites work
- Almost-sure growth rate of generalized random Fibonacci sequences
- An elementary proof that random Fibonacci sequences grow exponentially
- Automatic Sequences
- On \((a,b)\) pairs in random Fibonacci sequences
- On the average growth of random Fibonacci sequences
- Periodic coefficients and random Fibonacci sequences
- Random Fibonacci sequences and the number $1.13198824\dots$
- Sturmian words: structure, combinatorics, and their arithmetics
Cited in
(3)
This page was built for publication: Generalised Fibonacci sequences constructed from balanced words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239160)