Related papers: Fibonacci-Lucas densities
Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of…
Let $U$ be a Lucas sequence, $p$ be prime, and $\rho_U(p)$ be the rank of appearance of $p$ in $U$. We derive closed-form formulas for the Dirichlet density of primes $p$ for which $d\mid \rho_U(p)$, where $d\geq 1$ is a fixed integer. Our…
In the paper, we define the $q$-Fibonacci bicomplex quaternions and the $q$-Lucas bicomplex quaternions, respectively. Then, we give some algebraic properties of $q$-Fibonacci bicomplex quaternions and the $q$-Lucas bicomplex quaternions.
We study Gibonacci sequences mod $m$, giving special attention to the Lucas numbers. It is known which $m$ have the property that the Fibonacci sequence contains all residues mod $m$. When $m$ has this property, we say that the Fibonacci…
This paper explores profound generalizations of the Fibonacci sequence, delving into random Fibonacci sequences, $k$-Fibonacci words, and their combinatorial properties. We established that the $n$-th root of the absolute value of terms in…
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…
Fibonacci numbers and the golden ratio can be found in nearly all domains of Science, appearing when self-organization processes are at play and/or expressing minimum energy configurations. Several non-exhaustive examples are given in…
In this paper, the integral representations of the $k$-Pell and $k$-Pell-Lucas numbers are presented. Using Binet's formulas for these numbers, we obtain a number of identities and use elementary integral calculus to confirm their integral…
The skew of a binary string is the difference between the number of zeroes and the number of ones, while the length of the string is the sum of these two numbers. We consider certain suffixes of the lexicographically-least de Bruijn…
It is the intention of this paper to rigorously clarify the role of the occupation numbers in the current practical applications of the density functional formalism. In these calculations one has to decide how to distribute a given, fixed…
Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the…
This (partly expository) paper originated from the study of Hankel determinants of convolution powers of Catalan numbers and of Narayana polynomials. This led to some Hankel determinants of signed Catalan numbers whose values are multiples…
By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…
A full characterization of $(p,q)$-deformed Fibonacci and Lucas polynomials is given. These polynomials obey non-conventional three-term recursion relations. Their generating functions and Fourier integral transforms are explicitly computed…
Lucas polynomials are polynomials in $s_1$ and $s_2$ defined recursively by $\{0\}=0$, $\{1\}=1$, and $\{m\}=s_1\{m-1\}+s_2\{m-2\}$ for $m \geq 2$. We generalize Lucas polynomials from 2-variable polynomials to multivariable polynomials.…
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)…
We investigate numerically the configurational statistics of strings. The algorithm models an ensemble of global $U(1)$ cosmic strings, or equivalently vortices in superfluid $^4$He. We use a new method which avoids the specification of…
We prove a remarkable combinatorial symmetry in the number of spanning configurations in site percolation: for a large class of lattices, the number of spanning configurations with an odd or even number of occupied sites differs by $\pm 1$.…
We give multiple proofs of two formulas concerning the enumeration of permutations avoiding a monotone consecutive pattern with a certain value for the inverse peak number or inverse left peak number statistic. The enumeration in both cases…
Positive integers with all digits equal are called repdigits. In this paper, we find all balancing and Lucas-balancing numbers, which can be expressed as the difference of two repdigits. The method of proof involves the application of…