Related papers: Fibonacci Expansions
The paper contains enumerative combinatorics for positive braids, square free braids, and simple braids, emphasizing connections with classical Fibonacci sequence. The simple subgraph of the Cayley graph of the braid group is analyzed in…
We evaluate a determinant of generalized Fibonacci numbers, thus providing a common generalization of several determinant evaluation results that have previously appeared in the literature, all of them extending Cassini's identity for…
We give the first transcendence results for the Rosen continued fractions. Introduced over half a century ago, these fractions expand real numbers in terms of certain algebraic numbers.
An inequality, recently proposed by Franson [Phys. Rev. A 54, 3808 (1996)] is analyzed and improved. The inequality connects the change of the expectation value of an observable with the uncertainty of this observable. A strict bound on the…
Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
In this paper, by using bi-periodic Fibonacci numbers, we introduce the bi-periodic Fibonacci octonions. After that, we derive the generating function of these octonions as well as investigated some properties over them. Also, as another…
The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…
The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…
We look at a class of transcendental real numbers xi which, together with their square, satisfy some extremal property of simultaneous approximation by rational numbers with the same denominator. We give a sufficient condition for such a…
In 1920, MacMahon introduced two families of $q$-series to study divisor sums. Recent work has shown that MacMahon's $q$-series are closely connected to overpartitions and $3$-colored partitions. Merca introduced truncated forms of…
Using algebraic transformations and equivalent reformulations we derive a number of new results from some earlier ones (by the author) in more accepted terms closely related to well-known conjectures of Bondy and Jung including a number of…
In this study, we introduce the generalized Tribonacci hyperbolic spinors and properties of this new special numbers system by the generalized Tribonacci numbers, which are one of the most general form of the third-order recurrence…
We define a more general type of integral on time scales. The new diamond integral is a refined version of the diamond-alpha integral introduced in 2006 by Sheng et al. A mean value theorem for the diamond integral is proved, as well as…
By expressing Fibonacci and Lucas numbers in terms of the powers of the golden ratio, $\alpha=(1+\sqrt 5)/2$ and its inverse, $\beta=-1/\alpha=(1-\sqrt 5)/2$, a multitude of Fibonacci and Lucas identities have been developed in the…
Since Jun Li's original definition, several other definitions of expanded pairs and expanded degenerations have appeared in the literature. We explain how these definitions are related and introduce several new variants and perspectives.…
In this self-contained short note, we introduce the new definition of Good Ramanujan Expansion, say G.R.E., for a fixed arithmetic function $F$, building upon a good decay of its coefficients $G$; this, gains $\log-$powers w.r.t. the…
The sequence $F_{dn+h}$ and its convolutions have (for $h=0$) been studied in a recent paper at the arxiv [arXiv:2603.08636]. The instance with general $h$ is more involved and uses Chebyshev polynomials.
In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…
This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.