Related papers: Modular Periodicity of Random Initialized Recurren…
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…
The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…
In recent work, M. Just and the second author defined a class of "semi-modular forms" on $\mathbb C$, in analogy with classical modular forms, that are "half modular" in a particular sense; and constructed families of such functions as…
A famous theorem of Nakaoka asserts that the cohomology of the symmetric group stabilizes. The first author generalized this theorem to non-trivial coefficient systems, in the form of $\mathrm{FI}$-modules over a field, though one now…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…
Let $\{G_n\}$ be a periodic sequence of integers modulo $m$ and let $\{SG_n\}$ be the partial sum sequence defined by $SG_n:= \sum_{k=0}^nG_k $ (mod $m$). We give a formula for the period of $\{SG_n\}$. We also show that for a generalized…
What is the period of the Fibonacci sequence modulo a prime? The purpose of our brief expository paper is to illustrate an accessible, motivated treatment of this classical topic using only ideas from linear and abstract algebra (rather…
The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…
Double Fibonacci sequences are introduced and they are related to operations with Fibonacci modules. Generalizations and examples are also discussed.
The goal of this paper is twofold: (1) extend theory on certain statistics in the Fibonacci and Lucas sequences modulo $m$ to the Lucas sequences $U := \left(U_n(p,q)\right)_{n \geq 0}$ and $V := \left(V_n(p,q)\right)_{n \geq 0}$, and (2)…
Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…
We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
Let ${\cal P}$ be the set of palindromes occurring in the Fibonacci sequence. In this note, we establish three structures of $\mathcal{P}$ and and discuss their properties: cylinder structure, chain structure and recursive structure. Using…
An FI-module $V$ over a commutative ring $\bf{k}$ encodes a sequence $(V_n)_{n \geq 0}$ of representations of the symmetric groups $(\mathfrak{S}_n)_{n \geq 0}$ over $\bf{k}$. In this paper, we show that for a "finitely generated" FI-module…
We show that for primes $p < 10^{14}$ the period length $\kappa (p^2)$ of the Fibonacci sequence modulo $p^2$ is never equal to its period length modulo $p$. The investigation involves an extensive search by computer. As an application, we…
Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent…