Mario Catalani
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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.
In this article we study a generalization of Fibonomials, replacing the Fibonacci sequences by bivariate s-Fibonacci polynomial sequences. We call the obtained objects "Bivariate s-Fibopolynomials".
Based on well-known properties of Fibonacci and Lucas numbers and polynomials we give a self-contained approach to some bivariate analogs.
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.
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.
Fibonacci, Lucas, and Spread Polynomials
本文基于Fibonacci和Lucas多项式，对spread多项式的一种变体进行了初等阐述。
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.
We introduce a new bivariate polynomial ${\displaystyle J(G; x,y):=\sum\limits_{W \in V(G)} x^{|W|}y^{|N(W)|}}$ which contains the standard domination polynomial of the graph $G$ in two different ways. We build methods for efficient calculation of this polynomial and prove that there are still some families of graphs which have the same bivariate polynomial.
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…
Motivated by Dohmen-Pönitz-Tittmann's bivariate chromatic polynomial $χ_G(x,y)$, which counts all $x$-colorings of a graph $G$ such that adjacent vertices get different colors if they are $\le y$, we introduce a bivarate version of Stanley's order polynomial, which counts order preserving maps from a given poset to a chain. Our results include decomposition formulas in terms of linear extensions, a combinatorial reciprocity theorem, and connections to bivariate chromatic polynomials.
Polynomial Solutions to the First Order Difference Equations in the Bivariate Difference Field
本文利用二元差分域将二阶递推序列的求和转化为一阶差分方程，提出求其全部多项式解的算法，并给出可用于待定系数法的次数上界。
Three-dimensional Riordan arrays and bivariate Laguerre polynomials
本文提出用三维Riordan阵列表示各类Laguerre多项式族，并应用Riordan阵列基本定理推导出相应的指数生成函数。
The aim of this paper is to give some combinatorial relations linked polynomials generalizing those of Appell type to the partial r-Bell polynomials. We give an inverse relation, recurrence relations involving some family of polynomials and their exact expressions at rational values in terms of the partial r-Bell polynomials. We illustrate the obtained results by various comprehensive examples.
Bivariate $P$-polynomial association schemes
本研究定义了作为P-多项式结合方案推广的$(α,β)$型双变量P-多项式结合方案，证明其等价于一组交参数条件，发现诸多高秩结合方案属此类，并类似定义了双变量Q-多项式结合方案。
Multivariate Fibonacci-like Polynomials and their Applications
本文将Fibonacci多项式推广为多元$r$-Fibonacci多项式，扩展了Binet公式等经典结果，证明了其在复数域上的不可约性，并揭示了其与Bell多项式及Fubini数等的联系。
Deformed Bivariate $q$-Appell Polynomials
本文引入变形$q$-Appell型二元多项式集合，研究其代数性质与结构，揭示其与变形齐次多项式的关系，引入相关算子并推导出Mehler和Rogers型公式，最后给出Bernoulli、Euler和Genocchi型多项式实例。
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.
Bivariate $P$- and $Q$-polynomial structures of the association schemes based on attenuated spaces
本文研究基于衰减空间的结合方案的二元 $P$/ $Q$-多项式结构，借助对偶 $q$-Hahn 与仿射 $q$-Krawtchouk 多项式的邻接关系揭示其双谱代数和子成分代数，并与非二元 Johnson 方案比较。
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.
We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.
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.
A bivariate $Q$-polynomial structure for the non-binary Johnson scheme
针对非二元Johnson方案，本文证明其在部分参数下具备双变量$Q$-多项式结构，结合已有的$P$-多项式结构得到一类双变量正交多项式的双谱性质，并研究了相关代数结构。
Binomial Fibonacci sums from Chebyshev polynomials
本文通过将特定二项式系数求和与切比雪夫多项式建立联系，推导出涉及斐波那契数和卢卡斯数的新型二项式和恒等式，并进一步研究组合和及其与 Chu 和 Guo 2022 年工作的联系。
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…
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.
We study Dohmen--Pönitz--Tittmann's bivariate chromatic polynomial $c_Γ(k,l)$ which counts all $(k+l)$-colorings of a graph $Γ$ such that adjacent vertices get different colors if they are $\le k$. Our first contribution is an extension of $c_Γ(k,l)$ to signed graphs, for which we obtain an inclusion--exclusion formula and several special evaluations giving rise, e.g., to polynomials that encode balanced subgraphs. Our second goal is to derive combinatorial reciprocity theorems for $c_Γ(k,l)$ and its signed-graph analogues, reminiscent of Stanley's reciprocity theorem linking chromatic polynom…
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}$-斐波那契数的关联并推导后者的生成函数与递推关系。
On the Bivariate Characteristic Polynomial of the Shuffle Lattice
本文证明了Shuffle格的$M$-triangle显式公式，并揭示了其与$H$-triangle之间的关系。
Existence of Solutions of Functional-Difference Equations with Proportional Delay on Deformed Generalized Fibonacci Polynomials via Successive Approximation and Bell Polynomials
本文构建变形广义 Fibonacci 多项式上的微积分为框架，借助变形指数函数、逐次逼近法和 Bell 多项式证明比例延迟泛函差分方程解的存在性，并指出 q-周期情形下解不唯一。
Identically vanishing $k$-generalized Fibonacci polynomials
研究k-广义斐波那契多项式在负索引下的消失性质，推导多项式系数及根的性质，并提出更高效的组合求和表达式。
Some notes on a Fibonacci-Lucas identity
本文围绕 Edgar–Bhatnagar 的 Fibonacci–Lucas 多项式恒等式，为广义 Lucas 序列提出新的多项式恒等式、特例及 Chebyshev 多项式推广。
Let $S_n$ denote the symmetric group on $\{1,2,\ldots,n\}$. For two permutations $u, v\in S_n$ such that $u\leq v$ in the Bruhat order, let $R_{u,v}(q)$ and $\R_{u,v}(q)$ denote the Kazhdan-Lusztig $R$-polynomial and $\R$-polynomial, respectively. Let $v_n=34\cdots n\, 12$, and let $σ$ be a permutation such that $σ\leq v_n$. We obtain a formula for the $\R$-polynomials $\R_{σ,v_n}(q)$ in terms of the $q$-Fibonacci numbers depending on a parameter determined by the reduced expression of $σ$. When $σ$ is the identity $e$, this reduces to a formula obtained by Pagliacci. In another direction, we …
Bivariate local permutation polynomials, their companions, and related enumeration results
本文提出了一种新的有限域上排列群多项式家族，构造了其伴生多项式，并解决了$e$-Klenian多项式的计数问题。
We show that Genocchi and Bernoulli numbers are closely related to Fibonacci polynomials and derive some q-analogues.
The new combinatorial identities of symmetric functions
本文利用指数生成函数等初等方法，研究了与对称函数相关的二项式卷积及Bernoulli、Euler和Genocchi数与多项式的卷积和，推导并建立了二元多项式及相关特殊多项式的多个新组合恒等式。
We derive some q-analogs of Euler-Cassini-type identities and of recurrence formulas for powers of Fibonacci polynomials.
Bivariate Affine $q$-Krawtchouk Polynomials and Association Schemes over Galois Rings
该研究引入正则化二元仿射$q$-克劳特楚克多项式，证明其为$\operatorname{Mat}_{d\times n}(\operatorname{GR}(p^2,r))$上平移结合方案的首个特征矩阵，通过史密斯类型定义关系与特征值，利用递推关系完成证明。
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.
We give an overview about well-known basic properties of two classes of q-Fibonacci and q-Lucas polynomials and offer a common generalization.
Bivariate Chromatic Polynomials of Mixed Graphs
本文将二元色多项式概念扩展至包含有向和无向边的混合图，提出将其分解为二元阶多项式之和的公式，并证明了相应的组合互反定理。
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.
Some power series extensions of Fibonacci and Lucas polynomials
本研究聚焦形式幂级数领域，探讨可作为偶/奇下标斐波那契、卢卡斯多项式插值的形式幂级数，拓展了相关多项式的幂级数研究方向。
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
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.
Distance cube polynomials of Fibonacci and Lucas-run graphs
本文纠正了 Fibonacci-run 图距离立方体多项式生成函数的错误，并证明了建立 Lucas-run 图与 Fibonacci-run 图立方体多项式联系的猜想。
A bivariate version of the spread polynomials
本文研究展开多项式的二元变体，基于Herbig对Wildberger多项式的版本，探讨其性质与推广。
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.
Simplicial $d$-Polytopic Numbers Defined on Generalized Fibonacci Polynomials
本文定义了广义Fibonacci多项式上的单纯形$d$-多胞形数，建立了基本恒等式与$q$-恒等式，求出了生成函数及倒数之和，并引入了相应的Zeta函数。
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.
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.
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.
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.
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
该研究针对斐波那契、卢卡斯等序列的多项式恒等式，补充了广义斐波那契序列的相关恒等式，通过吉拉尔-沃林公式、比内公式结合线性代数两种方法完成序列分类，填补了数学文献中该类恒等式通用表述的空白。
Relations between Chebyshev, Fibonacci and Lucas polynomials via trigonometric sums
本文通过有限三角和建立斐波那契、卢卡斯与切比雪夫多项式间的新恒等式，并给出其物理解释及与图有效电阻的联系。
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.
Generalizing previous work of Hora (1998) on the asymptotic spectral analysis for the Hamming graph $H(n,q)$ which is the $n^{\mathrm{th}}$ Cartesian power $K_q^{\square n}$ of the complete graph $K_q$ on $q$ vertices, we describe the possible limits of the joint spectral distribution of the pair $(G^{\square n},\overline{G}\vphantom{G}^{\square n})$ of the $n^{\mathrm{th}}$ Cartesian powers of a strongly regular graph $G$ and its complement $\overline{G}$, where we let $n\rightarrow\infty$, and $G$ may vary with $n$. This result is an analogue of the bivariate central limit theorem, and we ob…
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined by {n choose k} = {n}!/({k}!{n-k}!) where {n}! = {1}{2}...{n}. These quotients are also polynomials in s and t, and specializations give the ordinary binomial coefficients, the Fibonomial coefficients, and the q-binomial coefficients. We present some of their fundamental properties, including a more general recursion for {n}, an analogue of the binomial the…
The Multiorbital Bivariate Chromatic Polynomial: A Subgroup-Lattice Refinement
本文引入多轨道双变量色多项式，推导其元素级表示，给出概率解释，研究其不交并行为与无边图特化，为相关图论研究提供新工具。
Given a bivariate system of polynomial equations with fixed support sets $A, B$ it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity $i$ for all $i$ in the range $\{0,1,...,|A|-|\mbox{conv}(A)\ominus B|-1\}$, where $A\ominus B$ is the set of all integral vectors that shift B to a subset of $A$. As an application of this result we classify all pairs $(A, B)$ such that the system supported at $(A, B)$ does not have a solution of multiplicity $3$.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。