相关论文: On the Enumeration and Asymptotic Analysis of Fibo…
We study formulas expressing Fibonacci numbers as sums over compositions using free submonoids of the free monoid of compositions with parts 1 and 2.
We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…
In this paper, we study the theory of the harmonic and the hyperharmonic Fibonacci numbers. Also, we get some combinatoric identities like as harmonic and hyperharmonic numbers and we obtain some useful formulas for $\mathbb{F}_{n}$, which…
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…
We make an asymptotic analysis via singularity analysis of generating functions of a number sequence that involves the Fibonacci numbers and generalizes the binomial coefficients.
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…
The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…
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…
There are three long-known types of restricted integer compositions whose counts match the Fibonacci sequence:\ one from ancient India and two from 19th century England. We give proofs of these enumeration results using tiling arguments and…
A \Def{composition} of a positive integer $n$ is a $k$-tuple $(\l_1, \l_2, \dots, \l_k) \in \Z_{> 0}^k$ such that $n = \l_1 + \l_2 + \dots + \l_k$. Our goal is to enumerate those compositions whose parts $\l_1, \l_2, \dots, \l_k$ avoid a…
In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…
The purpose of this paper is twofold. First, the definition of new statistical convergence with Fibonacci sequence is given and some fundamental properties of statistical convergence are examined. Second, approximation theory worked as a…
In this thesis we examined mathematical properties of Fibonacci numbers and applications of this numbers in the nature,geometry and economy.We obtained Golden section and proved some mathematical identities using Golden section. Infinity of…
We use generating functions to enumerate Arndt compositions, that is, integer compositions where there is a descent between every second pair of parts, starting with the first and second part, and so on. In 2013, J\"org Arndt noted that…
In 2013, Joerg Arndt recorded that the Fibonacci numbers count integer compositions where the first part is greater than the second, the third part is greater than the fourth, etc. We provide a new combinatorial proof that verifies his…
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
We consider the asymptotics of sums of the form $$ \frac1{F_n^\sigma} \sum_{m = 1}^{F_n-1} \frac{f(m/F_n)}{\left|{\sin(\pi m/F_n)}\right|^\sigma} \frac{f(F_{n-1}m/F_n)}{\left|{\sin(\pi F_{n-1}m/F_n)}\right|^\sigma} $$ where $(F_n)_{n \in…
For a fixed integer base $b\geq2$, we consider the number of compositions of $1$ into a given number of powers of $b$ and, related, the maximum number of representations a positive integer can have as an ordered sum of powers of $b$. We…
This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…