Recurrence relations for powers of q-Fibonacci polynomials

Some conjectures about q-Fibonacci polynomials

In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.

On a Generalized Fibonacci Recurrence

The generalized Fibonacci recurrence $g_n=g_{n-k}+g_{n-m}$ was recently used to demonstrate the theoretically optimal nature of limited senescence in morphologically symmetrically dividing bacteria. Here, we study this recurrence from a more abstract viewpoint, as a general model for asymmetric branching, and interpret solutions for different initial conditions in terms of branching-related quantities. We provide a compact diagrammatic representation for the evolution of this process which leads to an explicit binomial identity for the sums of elements lying on the diagonals $kx+my=n$ in Pasca…

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.

Legal Decompositions Arising from Non-positive Linear Recurrences

Zeckendorf's theorem states that any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers; this result has been generalized to many recurrence relations, especially those arising from linear recurrences with leading term positive. We investigate legal decompositions arising from two new sequences: the $(s,b)$-Generacci sequence and the Fibonacci Quilt sequence. Both satisfy recurrence relations with leading term zero, and thus previous results and techniques do not apply. These sequences exhibit drastically different behavior. We show that the $(s,b)$-Generacci s…

The Meta-C-finite Ansatz

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for every positive integer $m$, and these recurrences have an explicit, uniform representation. We will show that $a(mn)$ has a uniform recurrence over $m$ for any C-finite sequence $a(n)$ and use this to automatically derive some famous summation identities.

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.

On the duals of the Fibonacci and Catalan-Fibonacci polynomials and Motzkin paths

We use the inversion of coefficient arrays to define dual polynomials to the Fibonacci and Catalan-Fibonacci polynomials, and we explore the properties of these new polynomials sequences. Many of the arrays involved are Riordan arrays. Direct links to the counting of Motzkin paths by different statistics emerge.

非标准Zeckendorf分解；或者，Tribonacci在Fibonacci中

Non-standard Zeckendorf decompositions; or, Tribonacci within Fibonacci

研究用前k个Fibonacci数表示n的方式数B(n;k)，展示B(0;k)满足类似Tribonacci的递推关系，B(n;k)满足修改后的递推关系。

The Fibonacci Quilt Game

Zeckendorf proved that every positive integer can be expressed as the sum of non-consecutive Fibonacci numbers. This theorem inspired a beautiful game, the Zeckendorf Game. Two players begin with $n \ 1$'s and take turns applying rules inspired by the Fibonacci recurrence, $F_{n+1} = F_n + F_{n-1}$, until a decomposition without consecutive terms is reached; whoever makes the last move wins. We look at a game resulting from a generalization of the Fibonacci numbers, the Fibonacci Quilt sequence. These arise from the two-dimensional geometric property of tiling the plane through the Fibonacci s…

Fibonacci、Lucas与Spread多项式

Fibonacci, Lucas, and Spread Polynomials

本文基于Fibonacci和Lucas多项式，对spread多项式的一种变体进行了初等阐述。

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.

The number of valid factorizations of Fibonacci prefixes

We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words. In particular, we show that the sequence V(n) is the shuffle of the ceilings of two linear functions of n.

Generalized bivariate Fibonacci polynomials

We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in most cases generalize known results.

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.

Determinants of Rising Powers of Second Order Linear Recurrence Entries by Means of the Desnanot-Jacobi Identity

We apply the Desnanot-Jacobi identity to give an alternative proof of the determinants whose entries are rising powers of the Fibonacci numbers given by Prodinger. We then generalize the determinants to include entries that are rising powers of the terms in a second order linear recurrence.

Identities for Fibonacci and Lucas polynomials derived from a book of Gould

This note is dedicated to Professor Gould. The aim is to show how the identities in his book "Combinatorial Identities" can be used to obtain identities for Fibonacci and Lucas polynomials. In turn these identities allow to derive a wealth of numerical identities for Fibonacci and Lucas numbers.

A Symmetric Algorithm for Hyperharmonic and Fibonacci Numbers

In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers. An explicit formulae for hyperharmonic numbers, general generating functions of the Fibonacci- and Lucas numbers are obtained. Besides we define "hyperfibonacci numbers", "hyperlucas numbers". Using these new concepts, some relations between ordinary and incomplete Fibonacci- and Lucas numbers are investigated.

q-Fibonacci polynomials and q-Genocchi numbers

We show that Genocchi and Bernoulli numbers are closely related to Fibonacci polynomials and derive some q-analogues.

Polynomials and Second Order Linear Recurrences

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery, Hilbert's question whether there exists a general algorithm for checking the solvability in integers of any diophantine equation. In this paper we describe techniques to prove the nonexistence of polynomials in two variables for some simple generalizations of the Fibonacci sequence (explicit diophantine representation of Fibonacci numbers were known from Jones…

Some remarks on generalized Fibonacci and Lucas polynomials

Starting with some determinants of binomial coefficients which are related to Fibonacci and Lucas polynomials we study similar determinants for some generalizations of these polynomials and their q-analogues.

Some beautiful q-analogues of Fibonacci and Lucas polynomials

We give an overview about well-known basic properties of two classes of q-Fibonacci and q-Lucas polynomials and offer a common generalization.

Some elementary aspects of q-Fibonacci and q-Lucas polynomials

Based on well-known properties of Fibonacci and Lucas numbers and polynomials we give a self-contained approach to some bivariate analogs.

Chebyshev-Fibonacci polynomial relations using generating functions

The main object of the paper is to reveal connections between Chebyshev polynomials of the first and second kinds and Fibonacci polynomials introduced by Catalan. This is achieved by relating the respective (ordinary and exponential) generating functions to each other. As a consequence, we also establish new combinatorial identities for balancing polynomials and Fibonacci (Lucas) numbers.

块分离的超划分：斐波那契结构与欧拉因子分解

Block-Separated Overpartitions: Fibonacci Structure and Euler Factorization

本文研究了块分离的超划分，揭示其与斐波那契数列的关联，并通过生成函数和转移矩阵方法推导了相关递推关系和渐进行为。

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.

斐波那契多项式与卢卡斯多项式的若干幂级数推广

Some power series extensions of Fibonacci and Lucas polynomials

本研究聚焦形式幂级数领域，探讨可作为偶/奇下标斐波那契、卢卡斯多项式插值的形式幂级数，拓展了相关多项式的幂级数研究方向。

Prime Power Divisibility,Periodicity and Other Properties of Some Second Order Recurrences

Wall published a paper in 1960 on the Fibonacci sequence where he derived many results concerning the period and prime power divisibility modulo m. His periodicity results have been generalized to second order linear recurrences. Here we study the sequences generated by such recurrences, with starting values of {0,1}: among other things, we derive new prime power divisibility results, derive the period by new methods, establish new identities, show derivations involving powers of matrices generated by these general recurrences, etc.

Right Circulant Matrices with Generalized Fibonacci and\ Lucas Polynomials and Coding Theory

In this paper, we give two new coding algorithms by means of right circulant matrices with elements generalized Fibonacci and Lucas polynomials. For this purpose, we study basic properties of right circulant matrices using generalized Fibonacci polynomials $F_{p,q,n}\left( x\right) $, generalized Lucas polynomials $L_{p,q,n}\left( x\right) $ and geometric sequences.

Novel Results of Two Generalized Classes of Fibonacci and Lucas Polynomials and Their Uses in the Reduction of Some Radicals

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 $z$. Several new connection formulae between some famous polynomials such as Fibonacci, Lucas, Pell, Fermat, Pell-Lucas, and Fermat-Lucas polynomials are deduced as special cases of the derived connection formulae. Some of the introduced formulae generalize some of those existing in the literature. As two applications of the derived connection formulae, some…

Curious congruences for Fibonacci numbers

In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5)) (mod p^2)$$ and $$\sum_{k=0}^{p-1}F_{2k+1}\binom{2k}k=(-1)^{[p/5]}(p/5) (mod p^2).$$ We also obtain similar results for some other second-order recurrences and raise several conjectures.

Bernoulli-Fibonacci Polynomials

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 numbers are studied in parallel with usual Bernoulli counterparts. Fibonacci numbers and Golden ratio are intrinsically involved in formulas obtained.

利用Fuss-Catalan数求解k-广义斐波那契数

Solutions for $k$-generalized Fibonacci numbers using Fuss-Catalan numbers

该研究提出k-广义斐波那契数Fₖ(n)的新表达式，利用Fuss-Catalan数给出其特征多项式根的显式形式，量化渐近近似精度，提供任意初始条件下的递推基，扩展前人结果并发现多变量Dickson多项式关联及伴随矩阵新恒等式。

相同消失的k-广义斐波那契多项式

Identically vanishing $k$-generalized Fibonacci polynomials

研究k-广义斐波那契多项式在负索引下的消失性质，推导多项式系数及根的性质，并提出更高效的组合求和表达式。

Conway's subprime Fibonacci sequences

It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random behaviour and generally terminate in a handful of cycles, properties reminiscent of 3x+1 and related sequences. We examine the elementary properties of these 'subprime' Fibonacci sequences.

多元类Fibonacci多项式及其应用

Multivariate Fibonacci-like Polynomials and their Applications

本文将Fibonacci多项式推广为多元$r$-Fibonacci多项式，扩展了Binet公式等经典结果，证明了其在复数域上的不可约性，并揭示了其与Bell多项式及Fubini数等的联系。

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

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

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

Some enumerative properties of a class of Fibonacci-like cubes

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 this paper. Several enumerative polynomials, e.g.\ rank generating function, cube polynomials and degree sequence polynomials are obtained. Some of these results relate to Fibonacci sequence and Padovan sequence.

Generating Functions, Weighted and Non-Weighted Sums for Powers of Second-Order Recurrence Sequences

In this paper we find closed form for the generating function of powers of any non-degenerate second-order recurrence sequence, completing a study begun by Carlitz and Riordan in 1962. Moreover, we generalize a theorem of Horadam on partial sums involving such sequences. Also, we find closed forms for weighted (by binomial coefficients) partial sums of powers of any non-degenerate second-order recurrence sequences. As corollaries we give some known and seemingly unknown identities and derive some very interesting congruence relations involving Fibonacci and Lucas sequences.

Chebyshev Polynomials, Sliding Columns, and the $k$-step Fibonacci Numbers

We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the Fibonaccis, the Tribonaccis, the Tetranaccis, and so on.

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.

Sums of Powers of Fibonacci and Lucas Polynomials in terms of Fibopolynomials

We study sums of powers of Fibonacci and Lucas polynomials of the form $% \sum_{n=0}^{q}F_{tsn}^{k}(x) $ and $\sum_{n=0}^{q}L_{tsn}^{k}% (x) $, where $s,t,k$ are given natural numbers, together with the corresponding alternating sums $\sum_{n=0}^{q}(-1) ^{n}F_{tsn}^{k}(x) $ and $\sum_{n=0}^{q}(-1) ^{n}L_{tsn}^{k}(x) $. We give sufficient conditions on the parameters $s,t,k$ for express these sums as linear combinations of certain $s$-Fibopolynomials.

Melham's Conjecture on Odd Power Sums of Fibonacci Numbers

Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at certain Fibonacci number of odd order. We prove that this polynomial and its derivative both vanish at $1$, and will be an integer polynomial after multiplying it by a product of the first consecutive Lucas numbers of odd order. This presents an affirmative answer to a conjecture of Melham.

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.

Balancing polynomials, Fibonacci numbers and some new series for $π$

We evaluate some types of infinite series with balancing and Lucas-balancing polynomials in closed form. These evaluations will lead to some new curious series for $π$ involving Fibonacci and Lucas numbers. Our findings complement those of Castellanos from 1986 and 1989.

来自切比雪夫多项式的二项式斐波那契和

Binomial Fibonacci sums from Chebyshev polynomials

本文通过将特定二项式系数求和与切比雪夫多项式建立联系，推导出涉及斐波那契数和卢卡斯数的新型二项式和恒等式，并进一步研究组合和及其与 Chu 和 Guo 2022 年工作的联系。

随机初始化递推的模周期性

Modular Periodicity of Random Initialized Recurrences

研究所有可能初始值下随机初始化递推的周期结构，发现斐波那契递推与其奇偶变换的镜像对称性，揭示素数到素数幂模的分形自相似性，并定义由卢卡斯比值支配的极小分布。

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…

Catalan numbers, Hankel determinants and Fibonacci polynomials

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 of Fibonacci numbers and to some Hankel determinants of signed central binomial coefficients whose values are multiples of Lucas numbers. Most proofs are computational but we also include a combinatorial one due to Christian Krattenthaler. Finally we formulate some conjectures.

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

Polynomial Identities for Generalized Fibonacci Sequences

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

关于任意奇素数$p$且$k\geq0$时$p^{k}$-欧拉多项式与$p^{k}$-斐波那契数的研究

Study of $p^{k}$-Eulerian polynomials and $p^{k}$-Fibonacci numbers for every odd prime $p$ and $k\geq0$

该研究针对奇素数$p$与$k\geq0$的情形，定义$p$-Bratteli图路径的下降概念，提出$p^{k}$-欧拉多项式构造方法，揭示其与$p^{k}$-斐波那契数的关联并推导后者的生成函数与递推关系。

Recurrence Relations and Determinants

We examine relationships between two minors of order n of some matrices of n rows and n+r columns. This is done through a class of determinants, here called $n$-determinants, the investigation of which is our objective. We prove that 1-determinants are the upper Hessenberg determinants. In particular, we state several 1-determinants each of which equals a Fibonacci number. We also derive relationships among terms of sequences defined by the same recurrence equation independently of the initial conditions. A result generalizing the formula for the product of two determinants is obtained. Finall…

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

Relations between Chebyshev, Fibonacci and Lucas polynomials via trigonometric sums

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

基于逐次逼近法和 Bell 多项式的变形广义 Fibonacci 多项式上比例延迟泛函差分方程解的存在性

Existence of Solutions of Functional-Difference Equations with Proportional Delay on Deformed Generalized Fibonacci Polynomials via Successive Approximation and Bell Polynomials

本文构建变形广义 Fibonacci 多项式上的微积分为框架，借助变形指数函数、逐次逼近法和 Bell 多项式证明比例延迟泛函差分方程解的存在性，并指出 q-周期情形下解不唯一。

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

Some notes on a Fibonacci-Lucas identity

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