Related papers: Fibonacci-Lucas densities
We analyze the spectra of generalized Fibonacci and Fibonacci-like operators in Banach space $l^1$. Some of the results have application in population dynamics.
In this paper, we present a new approach to the convolved Fibonacci numbers arising from the generating function of them and give some new and explicit identities for the convolved Fibonacci numbers.
We propose the consistent statistical approach to consider a wide class of classical open systems whose states are specified by a set of positive integers(occupation numbers).Such systems are often encountered in physics, chemistry,…
A binary representation of complex rational numbers and their arithmetic is described that is not based on qubits. It takes account of the fact that $0s$ in a qubit string do not contribute to the value of a number. They serve only as place…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
Using a straightforward elementary approach, we derive numerous infinite arctangent summation formulas involving Fibonacci and Lucas numbers. While most of the results obtained are new, a couple of celebrated results appear as particular…
We define and study the combinatorial properties of compositional Bernoulli numbers and polynomials within the framework of rational combinatorics.
We describe how to compute the intersection of two Lucas sequences of the forms $\{U_n(P,\pm 1) \}_{n=0}^{\infty}$ or $\{V_n(P,\pm 1) \}_{n=0}^{\infty}$ with $P\in\mathbb{Z}$ that includes sequences of Fibonacci, Pell, Lucas, and Lucas-Pell…
By means of two complex-valued functions (depending on an integer parameter P>=1) we construct helices of integer ratio R>=1 related to the so-called Binet formulae for P-Lucas and P-Fibonacci sequences. Based on these functions a new map…
In 2016, Y\"uce and Torunbalc\i\ Ayd\i n \cite{Yuc-Tor} defined dual Fibonacci quaternions. In this paper, we defined the dual third-order Jacobsthal quaternions and dual third-order Jacobsthal-Lucas quaternions. Also, we investigated the…
In this paper, we have considered the dense rank for assigning positions to alternatives in weak orders. If we arrange the alternatives in tiers (i.e., indifference classes), the dense rank assigns position 1 to all the alternatives in the…
This paper first discusses the size and orientation of hat supertiles. Fibonacci and Lucas sequences, as well as a third integer sequence linearly related to the Lucas sequence are involved. The result is then generalized to any aperiodic…
We discuss the occupation number correlations in an ultracold system of interacting fermionic atoms. For a system with a special energy-level distribution, viz. two multiply-degenerate levels, explicit expressions for the correlation…
We study topological, metric and fractal properties of set of numbers $[0;1]$ with given asymptotic mean of digits in their ternary representation. We investigate connection of these numbers and numbers with a given frequency of digits.
The convolved Fibonacci numbers F_j^(r) are defined by (1-z-z^2)^{-r}=\sum_{j>=0}F_{j+1}^(r)z^j. In this note some related numbers that can be expressed in terms of convolved Fibonacci numbers are considered. These numbers appear in the…
In this paper, we give some properties of the Tribonacci and Tribonacci-Lucas quaternions and obtain some identities for them.
A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…
The concept of "lost positions" is a recently introduced tool for counting the number of runs in words. We investigate the frequency of lost positions in prefixes of words. This leads to an algorithm that allows to show, using an extensive…