Generalised Fibonacci sequences constructed from balanced words
From MaRDI portal
Publication:2239160
DOI10.1016/j.jnt.2021.05.008zbMath1498.11054arXiv1910.07824OpenAlexW3171703036WikidataQ114156945 ScholiaQ114156945MaRDI QIDQ2239160
Publication date: 3 November 2021
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.07824
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Matrices, determinants in number theory (11C20)
Cites Work
- Unnamed Item
- Periodic coefficients and random Fibonacci sequences
- An elementary proof that random Fibonacci sequences grow exponentially
- Almost-sure growth rate of generalized random Fibonacci sequences
- Sturmian words: structure, combinatorics, and their arithmetics
- On \((a,b)\) pairs in random Fibonacci sequences
- Automatic Sequences
- Random Fibonacci sequences and the number $1.13198824\dots$
This page was built for publication: Generalised Fibonacci sequences constructed from balanced words