Víctor Sirvent | Searcharxiv

arXiv2026

On the Lorenz-Fibonacci sequences and substitutions

In the present article, we consider two families of integer sequences, the $(k,r)$-Lorenz-Fibonacci sequences of the first and second kind, whose characteristic polynomial is $$p_{k,r}(x)=x^k-x^{k-1}-\cdots- x^r+x^{r-1}+\cdots +x+1,$$ where $k\geq 2r+1$, and $k\geq 3$. These families include the well-known $k$-bonacci sequence, when $r=0$. These sequences arise naturally in the study of the dynamics of the Lorenz attractor. We introduce two families of substitutions (in an alphabet of $k$ symbols) so that they are associated with each of the families of integer sequences and share the same polynomial. We study the main combinatorial properties of these substitutions.

math.NT↗

arXiv2015

A $q$-analogue of the Biperiodic Fibonacci Sequence

The Fibonacci sequence has been generalized in many ways. One of them is defined by the relation $t_n=at_{n-1}+t_{n-2}$ if $n$ is even, $t_n=bt_{n-1}+t_{n-2}$ if $n$ is odd, with initial values $t_0=0$ and $t_1=1$, where $a$ and $b$ are positive integers. This sequence is called biperiodic Fibonacci sequence. In this paper, we introduce a $q$-analogue of this sequence. We prove several identities of $q$-analogues of the Fibonacci sequence. We give algebraic and combinatorial proofs.

math.CO↗