相关论文: Fibonacci-Lucas densities
Powers of Fibonacci polynomials are expressed as single sums, improving on a double sum recently seen in the literature.
We derive generalizations of a couple of inverse tangent summation identities involving Fibonacci and Lucas numbers. As byproducts we establish many new inverse tangent identities involving the Fibonacci and Lucas numbers.
We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…
A Fibonacci pair $F_s(w,x)$ of rank $s$ is a pair $s \times s$ nonsingular matrices such that $wx=xw$ and that the entries of $aw^n$ and $axw^m$ are polynomials of Fibonacci or Lucas numbers for some nonzero $a$. We construct identities…
In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the…
We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings…
In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…
Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in simple situations. This paper concerns binary radix systems, i.e., positional number systems with digits…
A lucasene is a hexagon chain that is similar to a fibonaccene, an $L$-fence is a poset the Hasse diagram of which is isomorphic to the directed inner dual graph of the corresponding lucasene. A new class of cubes, which named after…
We give one parameter generalizations of the Fibonacci and Lucas numbers denoted by $\{F_n(\th)\}$ and $\{L_n(\th)\}$, respectively. We evaluate the Hankel determinants with entries $\{1/F_{j+k+1}(\th): 0\le i,j \le n\}$ and…
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…
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
The tight-binding model for a chain, where the hopping constants follow a Fibonacci sequence, predicts multifractality in the spectrum and wavefunctions. Experimentally, we realize this model by chains of small dielectric resonators with…
In this article, we will discover some new generalized identity regarding continued fractions. We will connect the results to Fibonacci numbers and Lucas numbers. For all the proof, we will use induction.
In this paper, we show that for any integer $a \geq 2$, each of the intervals $[a^k , a^{k + 1})$ ($k \in \mathbb{N}$) contains either $\left\lfloor \frac{\log a}{\log\Phi}\right\rfloor$ or $\left\lceil \frac{\log a}{\log\Phi}\right\rceil$…
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robustness and compression capability. Asymptotically, these codes provide better compression efficiency as the order of the underlying Fibonacci…
This paper is concerned with developing some new connection formulae between two generalized classes of Fibonacci and Lucas polynomials. All the connection coefficients involve hypergeometric functions of the type $_2F_{1}(z)$, for certain…
Consider two independent random strings having same length and taking values uniformly in a common finite alphabet. We study the order of the variance of the length of the longest common subsequences (LCS) of these strings when long blocks,…
With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…
A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5 conversion factor on Lucus numbers gives a faster…