Periodic coefficients and random Fibonacci sequences
Summary: The random Fibonacci sequence is defined by \(t_1 = t_2 = 1\) and \(t_n = \pm t_{n-1} + t_{n-2}\), for \(n \geq 3\), where each \(\pm\) sign is chosen at random with probability \(P(+) = P(-) = \frac{1}{2}\). Viswanath has shown that almost all random Fibonacci sequences grow exponentially at the rate \(1.13198824\ldots\). We will consider what happens to random Fibonacci sequences when we remove the randomness; specifically, we will choose coefficients which belong to the set \(\{1, -1\}\) and form periodic cycles. By rewriting our recurrences using matrix products, we will analyze sequence growth and develop criteria based on eigenvalue, trace and order for determining whether a given sequence is bounded, grows linearly or grows exponentially. Further, we will introduce an equivalence relation on the coefficient cycles such that each equivalence class has a common growth rate, and consider the number of such classes for a given cycle length.
- Almost-sure growth rate of generalized random Fibonacci sequences
- An infinite transfer matrix approach to the product of random 2 × 2 positive matrices
- Finite Groups of Matrices Whose Entries Are Integers
- Generalizations of the periodicity of certain recursive sequences
- Growth and decay of random Fibonacci sequences
- How do random Fibonacci sequences grow?
- scientific article; zbMATH DE number 3559810 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 194969 (Why is no real title available?)
- Noncommuting Random Products
- On the cycle expansion for the Lyapunov exponent of a product of random matrices
- On the periodicity of certain recursive sequences
- Random Fibonacci sequences and the number $1.13198824\dots$
- The on-line encyclopedia of integer sequences
- The resistance of randomly grown trees
- Generalised Fibonacci sequences constructed from balanced words
- Generalizations of the periodicity of certain recursive sequences
- A transfer operator approach to random Fibonacci sequences
- A Fibonacci type sequence with Prouhet-Thue-Morse coefficients
- scientific article; zbMATH DE number 3895140 (Why is no real title available?)
- Weak disorder in Fibonacci sequences
- The random Fibonacci recurrence and the visible points of the plane
- On the periodicity of certain recursive sequences
This page was built for publication: Periodic coefficients and random Fibonacci sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396963)
