Generalizations of some identities involving the fibonacci numbers

广义 Fibonacci 数、Catalan 数与调和数的恒等式及生成函数

Identities and Generating Functions of Products of Generalized Fibonacci numbers, Catalan and Harmonic Numbers

本文研究了广义 Fibonacci 与 Lucas 数类的性质，获得了著名 Fibonacci 恒等式的类比及乘积卷积新恒等式，并写下了其乘积、多截、调和数与 Catalan 数的生成函数。

Some Weighted Generalized Fibonacci Number Summation Identities, Part 1

The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A number of weighted generalized Fibonacci number summation identities are derived this way. From these identities some infinite series, generating functions and convolution identities are obtained. In addition, some weighted generalized Fibonacci number summation identities with binomial coefficients are derived. Many examples of both types of summation identities…

Four New Generalized Fibonacci Number Summation Identities

Two new generalized Fibonacci number summation identities are stated and proved, and two other new generalized Fibonacci number summation identities are derived from these, of which two special cases are already known in literature.

Some formulae for bivariate Fibonacci and Lucas polynomials

We derive a collection of identities for bivariate Fibonacci and Lucas polynomials using essentially a matrix approach as well as properties of such polynomials when the variables $x$ and $y$ are replaced by polynomials. A wealth of combinatorial identities can be obtained for selected values of the variables.

Statistical Distributions and $q$-Analogues of $k$-Fibonacci Numbers

We study $q$-analogues of $k$-Fibonacci numbers that arise from weighted tilings of an $n\times1$ board with tiles of length at most $k$. The weights on our tilings arise naturally out of distributions of permutations statistics and set partitions statistics. We use these $q$-analogues to produce $q$-analogues of identities involving $k$-Fibonacci numbers. This is a natural extension of results of the first author and Sagan on set partitions and the first author and Mathisen on permutations. In this paper we give general $q$-analogues of $k$-Fibonacci identities for arbitrary weights that depe…

Fibonacci Identities and Graph Colorings

We generalize both the Fibonacci and Lucas numbers to the context of graph colorings, and prove some identities involving these numbers. As a corollary we obtain new proofs of some known identities involving Fibonacci numbers such as \[F_{r+s+t} = F_{r+1}F_{s+1}F_{t+1} + F_r F_s F_t - F_{r-1}F_{s-1}F_{t-1}.\]

The Geometry of some Fibonacci Identities in the Hosoya Triangle

The \emph{Hosoya triangle} is a triangular array where every entry is a product of two Fibonacci numbers. We use the geometry of this triangle to find new identities related to Fibonacci numbers. We give geometric interpretation for some well-known identities of Fibonacci numbers. For instance, the Cassini identity and the Catalan identity. We also extend some identities that hold in the Pascal triangle to the Hosoya triangle. For instance, the hockey stick extends from binomials to products of Fibonacci numbers and the rhombus property extends a binomial identity from the Pascal triangle to a…

Compositions and Fibonacci Identities

We study formulas expressing Fibonacci numbers as sums over compositions using free submonoids of the free monoid of compositions with parts 1 and 2.

New binomial Fibonacci sums

We present some new linear, quadratic, cubic and quartic binomial Fibonacci, Lucas and Fibonacci--Lucas summation identities.

Tilings of a Honeycomb Strip and Higher Order Fibonacci Numbers

In this paper we explore two types of tilings of a honeycomb strip and derive some closed form formulas for the number of tilings. Furthermore, we obtain some new identities involving tribonacci numbers, Padovan numbers and Narayana's cow sequence and provide combinatorial proofs for several known identities about those numbers.

Survey of Cubic Fibonacci Identities - When Cuboids Carry Weight

The aim of this paper is to present a comprehensive survey of cubic Fibonacci identities, trying to uncover as many as possible. From the outset, our rationale for a very careful search on an apparently obscure problem was not only a matter of mathematical curiosity, but also motivated by a quest for 3D Fibonacci spirals. As we were not able to find any survey on the particular topic of cubic Fibonacci identities we decided to try to fill this void. We started by surveying many Fibonacci identities and recording cubic ones. Obviously, tracing all Fibonacci identities (for identifying a handful…

广义斐波那契序列的多项式恒等式

Polynomial Identities for Generalized Fibonacci Sequences

该研究针对斐波那契、卢卡斯等序列的多项式恒等式，补充了广义斐波那契序列的相关恒等式，通过吉拉尔-沃林公式、比内公式结合线性代数两种方法完成序列分类，填补了数学文献中该类恒等式通用表述的空白。

Analogues of a Fibonacci-Lucas Identity

Sury's 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and Quinn's 2003 book: {\em Proofs that count: The art of combinatorial proof}) has excited a lot of comment. We give an alternate, telescoping, proof of this---and associated---identities and generalize them. We also give analogous identities for other sequences that satisfy a three-term recurrence relation.

Identities for Tribonacci-related sequences

We establish some identities relating two sequences that are, as explained, related to the Tribonacci sequence. One of these sequences bears the same resemblance to the Tribonacci sequence as the Lucas sequence does to the Fibonacci sequence. Defining a matrix that we call Tribomatrix, which extends the Fibonacci matrix, we see that the other sequence is related to the sum of the determinants of the 2nd order principal minors of this matrix.

Durfee矩形恒等式作为无限Fibonacci构型的特征恒等式

Durfee rectangle identities as character identities for infinite Fibonacci configurations

本文引入无限Fibonacci构型空间，参数化格点超顶点代数中的Feigin-Stoyanovsky型基，通过两种方式计算特征，得到带位移的Durfee矩形恒等式。

Set partition statistics and q-Fibonacci numbers

We consider the set partition statistics ls and rb introduced by Wachs and White and investigate their distribution over set partitions avoiding certain patterns. In particular, we consider those set partitions avoiding the pattern 13/2, $Π_n(13/2)$, and those avoiding both 13/2 and 123, $Π_n(13/2,123)$. We show that the distribution over $Π_n(13/2)$ enumerates certain integer partitions, and the distribution over $Π_n(13/2,123)$ gives q-Fibonacci numbers. These q-Fibonacci numbers are closely related to q-Fibonacci numbers studied by Carlitz and by Cigler. We provide combinatorial proofs that…

2×2矩阵对称幂的幂与迹以及组合、斐波那契和卢卡斯恒等式

Powers and trace of symmetric powers of $2\times 2$ matrices and combinatorial, Fibonacci and Lucas identities

研究2×2矩阵对称幂的幂与迹，通过计算二阶完全有向图上特定路径给出相关公式完整证明，与其他公式比较得出组合恒等式，尤其是斐波那契和卢卡斯数的表达式。

Derivations and identities for Fibonacci and Lucas polynomials

We introduce the notion of Fibonacci and Lucas derivations of the polynomial algebras and prove that any element of kernel of the derivations defines a polynomial identity for the Fibonacci and Lucas polynomials. Also, we prove that any polynomial identity for Appel polynomial yields a polynomial identity for the Fibonacci and Lucas polynomials and describe the corresponding intertwining maps.

通过晶体能量得到的 Rogers–Ramanujan 恒等式的 Fibonacci 变体

A Fibonacci variant of the Rogers-Ramanujan identities via crystal energy

本文为完美晶体引入长度函数，并利用晶体能量导出含 Fibonacci 数 q-模拟的 Rogers–Ramanujan 恒等式变体。

Combinatorialization of Sury and McLaughlin identities, general linear recurrences in a unified approach

In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix. Also, we derive a determinantal expression of Fibonacci and Lucas numbers. We prove Binets formula for Fibonacci and Lucas numbers in a purely combinatorial way and in course of doing so, we find a determinantal identity, which we think to be new.

A weighted extension of Fibonacci numbers

We extend Fibonacci numbers with arbitrary weights and generalize a dozen Fibonacci identities. As a special case, we propose an elliptic extension which extends the $q$-Fibonacci polynomials appearing in Schur's work. The proofs of most of the identities are combinatorial, extending the proofs given by Benjamin and Quinn, and in the $q$ case, by Garrett. Some identities are proved by telescoping.

涉及斐波那契数与卢卡斯数的二项式和关系

Binomial sum relations involving Fibonacci and Lucas numbers

该研究探讨了含（广义）斐波那契数、卢卡斯数与不同类型二项式系数的二项式和的关联，给出多类二项式和关系并重新发现部分已作为问题提案的关系式。

A new combinatorial interpretation of the Fibonacci numbers squared

We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares separated by a gap of width $\frac12$. We show that the number of ways to tile an $n$-board using these types of tiles equals $F_{n+1}^2$ where $F_n$ is the $n$th Fibonacci number. We use these tilings to devise combinatorial proofs of identities relating the Fibonacci numbers squared to one another and to other number sequences. Some of these identities appear …

关于一个 Fibonacci–Lucas 恒等式的若干注记

Some notes on a Fibonacci-Lucas identity

本文围绕 Edgar–Bhatnagar 的 Fibonacci–Lucas 多项式恒等式，为广义 Lucas 序列提出新的多项式恒等式、特例及 Chebyshev 多项式推广。

New Combinatorial Interpretations of the Fibonacci Numbers Squared, Golden Rectangle Numbers, and Jacobsthal Numbers Using Two Types of Tile

We consider the tiling of an $n$-board (a board of size $n\times1$) with squares of unit width and $(1,1)$-fence tiles. A $(1,1)$-fence tile is composed of two unit-width square subtiles separated by a gap of unit width. We show that the number of ways to tile an $n$-board using unit-width squares and $(1,1)$-fence tiles is equal to a Fibonacci number squared when $n$ is even and a golden rectangle number (the product of two consecutive Fibonacci numbers) when $n$ is odd. We also show that the number of tilings of boards using $n$ such square and fence tiles is a Jacobsthal number. Using combi…

Generalized Fibonacci numbers and dimer statistics

We establish new product identities involving the $q$-analogue of the Fibonacci numbers. We show that the identities lead to alternate expressions of generating functions for close-packed dimers on non-orientable surfaces.

Restricted permutations related to Fibonacci numbers and k-generalized Fibonacci numbers

We give enumerations of various families of restricted permutations involving the Fibonacci numbers or k-generalized Fibonacci numbers.

二次代数中幂的通用恒等式及斐波那契恒等式的矩阵导出

Quadratic Reduction and Classical Multiple-Index Fibonacci-Lucas Identities

研究二次代数中元素幂的通用恒等式，通过矩阵迹和行列式推导斐波那契数列的二项式展开公式，揭示恒等式源于普遍代数原理。

Urn Models and Fibonacci Series

We use probability urn models to discover some known and unknown series identities involving Fibonacci numbers.

切比雪夫、斐波那契与卢卡斯多项式之间通过三角和建立的关系

Relations between Chebyshev, Fibonacci and Lucas polynomials via trigonometric sums

本文通过有限三角和建立斐波那契、卢卡斯与切比雪夫多项式间的新恒等式，并给出其物理解释及与图有效电阻的联系。

Recurrence relations for powers of q-Fibonacci polynomials

We derive some q-analogs of Euler-Cassini-type identities and of recurrence formulas for powers of Fibonacci polynomials.

Fibonacci polynomials

The Fibonacci polynomials $\big\{F_n(x)\big\}_{n\ge 0}$ have been studied in multiple ways. In this paper we study them by means of the theory of Heaps of Viennot. In this setting our polynomials form a basis $\big\{P_n(x)\big\}_{n\ge 0}$ with $P_n(x)$ monic of degree $n$. This given, we are forced to set $P_n(x)=F_{n+1}(x)$. The Heaps setting extends the Flajolet view of the classical theory of orthogonal polynomials given by a three term recursion. Thus with Heaps most of the identities for our $P_n(x)'s$ can be derived by combinatorial arguments. Using the present setting we derive a variet…

定义在广义Fibonacci多项式上的单纯形$d$-多胞形数

Simplicial $d$-Polytopic Numbers Defined on Generalized Fibonacci Polynomials

本文定义了广义Fibonacci多项式上的单纯形$d$-多胞形数，建立了基本恒等式与$q$-恒等式，求出了生成函数及倒数之和，并引入了相应的Zeta函数。

Binomial Fibonacci Power Sums

We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.

掷硬币游戏与 Fibonacci 数的推广

A coin flip game and generalizations of Fibonacci numbers

研究持续掷硬币直至特定字符串出现的游戏，求得特定结束字符串下的期望掷币次数，并导出涉及 Fibonacci 数推广的求和恒等式。

Summation Identities Involving Padovan and Perrin Numbers

Unlike in the case of Fibonacci and Lucas numbers, there is a paucity of literature dealing with summation identities involving the Padovan and Perrin numbers. In this paper, we derive various summation identities for these numbers, including binomial and double binomial identities. Our results derive from the rich algebraic properties exhibited by the zeros of the characteristic polynomial of the Padovan/Perrin sequence.

Permutation Statistics and $q$-Fibonacci Numbers

In a recent paper, Goyt and Sagan studied distributions of certain set partition statistics over pattern restricted sets of set partitions that were counted by the Fibonacci numbers. Their study produced a class of $q$-Fibonacci numbers, which they related to $q$-Fibonacci numbers studied by Carlitz and Cigler. In this paper we will study the distributions of some Mahonian statistics over pattern restricted sets of permutations. We will give bijective proofs connecting some of our $q$-Fibonacci numbers to those of Carlitz, Cigler, Goyt and Sagan. We encode these permutations as words and use a…

$q$-Fibonacci数及其二项式类似物的组合解释

Combinatorial Interpretations of $q$-Fibonacci Numbers and Their Binomial Analogues

本文提出一个推广Bergeron方法的q-Fibonacci数新模型，为q-Fibonomial系数的阶梯模型提供非双射证明，并展示了涉及该系数的新恒等式，增强了对相关数学对象的组合理解。

Complementary Families of the Fibonacci-Lucas Relations

In this paper we present two families of Fibonacci-Lucas identities, with the Sury's identity being the best known representative of one of the families. While these results can be proved by means of the basic identity relating Fibonacci and Lucas sequences we also provide a bijective proof. Both families are then treated by generating functions.

Statistics on Almost-Fibonacci Pattern-Avoiding Permutations

We prove that $|Av_n(231,312,1432)|$, $|Av_n(312,321,1342)|$ $|Av_n(231,312,4321,21543)|$, and $ |Av_n(321,231,4123,21534)|$, are all equal to $F_{n+1} - 1$ where $F_n$ is the $n$-th Fibonacci number using the convention $F_0 = F_1 = 1$ and $Av_n(S)$ is the set of all permutations of length $n$ that avoid all of the patterns in the set $S$. To do this, we characterize the structures of the permutations in these sets in terms of Fibonacci permutations. Then, we further quantify the structures using statistics such as inversion number and a statistic that measures the length of Fibonacci subsequ…

Zeckendorf expansion, Dirichlet series and infinite series involving the infinite Fibonacci word

Let $β=\frac{1+\sqrt{5}}{2}$, $(a_n)_{n \in \mathbb{N}^+}$ be a non-uniform morphic sequence involving the infinite Fibonacci word and $(δ(n))_{n \in \mathbb{N}^+}$ be a positive sequence such that for all positive integers $n$, $δ(n)=\frac{1}{\sqrt{5}}\sum_{j \geq 0}ε_jβ^{j+2}$ if the unique Zeckendorf expansion of $n$ is $n=\sum_{j \geq 0}ε_jF_{j+2}$ with Fibonacci numbers $F_0,F_1,F_2...$. We define and study some Dirichlet series in the form of $\sum_{n\geq 1}\frac{a_n}{(δ(n))^s}$ and relations between them. Moreover, we compute the values of some infinite series involving the infinite Fib…

Determinants Containing Powers of Generalized Fibonacci Numbers

We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These studies have led us to discover a fundamental identity of determinant involving powers of linear polynomials. Finally, we discuss the determinants of matrices whose entries are products of the generalized Fibonacci numbers.

Connection between ordinary multinomials, generalized Fibonacci numbers, partial Bell partition polynomials and convolution powers of discrete uniform distribution

Using an explicit computable expression of ordinary multinomials, we establish three remarkable connections, with the q-generalized Fibonacci sequence, the exponential partial Bell partition polynomials and the density of convolution powers of the discrete uniform distribution. Identities and various combinatorial relations are derived.

Number of Compositions and Convolved Fibonacci numbers

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 Fibonacci numbers are proved. We also show that numbers of compositions of a natural number with fixed number of ones appear as coefficients of characteristic polynomial of a Hessenberg matrix which determinant is a Fibonacci number. We derive the explicit formula for the number of such compositions, in terms of convolutions of Fibonacci numbers.

Fibonacci polynomials, generalized Stirling numbers, and Bernoulli, Genocchi and tangent numbers

We study matrices which transform the sequence of Fibonacci or Lucas polynomials with even index to those with odd index and vice versa. They turn out to be intimately related to generalized Stirling numbers and to Bernoulli, Genocchi and tangent numbers and give rise to various identities between these numbers. There is also a close connection with the Akiyama-Tanigawa algorithm.

Certain Binomial Sums with recursive coefficients

In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving binomial coefficients and Fibonacci type sequences.

关于若干涉及二项式系数$\binom{3n}{n}$的级数

On some series involving the binomial coefficients $\binom{3n}{n}$

该研究利用简单变换简化了Necdet Batir提出的含二项式系数$\binom{3n}{n}$的级数形式，给出新求值结果，建立其与Fibonacci数、黄金比例的关联，还推导了含该系数倒数的Fibonacci与Lucas级数。

Determinant Identities for Toeplitz-Hessenberg Matrices with Tribonacci Number Entries

In this paper, we evaluate determinants of some families of Toeplitz-Hessenberg matrices having tribonacci number entries. These determinant formulas may also be expressed equivalently as identities that involve sums of products of multinomial coefficients and tribonacci numbers. In particular, we establish a connection between the tribonacci and the Fibonacci and Padovan sequences via Toeplitz-Hessenberg determinants. We then obtain, by combinatorial arguments, extensions of our determinant formulas in terms of generalized tribonacci sequences satisfying an r-th order recurrence of a more gen…

Some Identities Involving Three Kinds of Counting Numbers

In this note, we present several identities involving binomial coefficients and the two kind of Stirling numbers.

A Family of the Zeckendorf Theorem Related Identities

In this paper we present a family of identities for recursive sequences arising from a second order recurrence relation, that gives instances of Zeckendorf representation. We prove these results using a special case of an universal property of the recursive sequences. In particular cases we also establish a direct bijection. Besides, we prove further equalities that provide a representation of the sum of $(r+1)$-st and $(r-1)$-st Fibonacci number as the sum of powers of the golden ratio. Similarly, we show a class of natural numbers represented as the sum of powers of the silver ratio.

Some Determinantal Identities

Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the inverse of the Vandermonde matrix. Then we derive a recurrence formula for sums of powers, which is similar to the well-known Newton identity. In the last section, we consider some sequences given by a homologous linear recurrence equation. A determinantal identity for the Fibonacci numbers of higher order is proved. We finish with an expression of the generalize…

Two New Identities Involving the Catalan Numbers: A classical approach

Two new identities about Catalan numbers are treated with Zeilberger's algorithm and Watson's hypergeometric series evaluation.

On the self-convolution of generalized Fibonacci numbers

We focus on a family of equalities pioneered by Zhang and generalized by Zao and Wang and hence by Mansour which involves self convolution of generalized Fibonacci numbers. We show that all these formulas are nicely stated in only one equation involving a bivariate ordinary generating function and we give also a formula for the coefficients appearing in that context. As a consequence, we give the general forms for the equalities of Zhang, Zao-Wang and Mansour.

Some Combinatorial Identities some of which involving Harmonic Numbers

A product difference equation is proved and used for derivation by elementary methods of four combinatorial identities, eight combinatorial identities involving generalized harmonic numbers and eight combinatorial identities involving classical harmonic numbers. For the binomial coefficients the definition with gamma functions is used, thus also allowing non-integer arguments in the identities. The generalized harmonic numbers in this case are harmonic numbers with a complex offset, where the classical harmonic numbers are a special case with offset zero.