Related papers: Generalized Fibonacci polynomials and Fibonomial c…
About four centuries ago, Johann Faulhaber developed formulas for the power sum $1^n + 2^n + \cdots + m^n$ in terms of $m(m+1)/2$. The resulting polynomials are called the Faulhaber polynomials. We first give a short survey of Faulhaber's…
In this paper, we present a probabilistic extension of the Fubini polynomials and numbers associated with a random variable satisfying some appropriate moment conditions. We obtain the exponential generating function and an integral…
$q$-Analogues of the coefficients of $x^a$ in the expansion of $\prod_{j=1}^N (1+x+...+x^j)^{L_j}$ are proposed. Useful properties, such as recursion relations, symmetries and limiting theorems of the ``$q$-supernomial coefficients'' are…
In the present paper combinatorial identities involving q-dual sequences or polynomials with coefficients q-dual sequences are derived. Further, combinatorial identities for q-binomial coefficients(Gaussian coefficients), q-Stirling numbers…
It is well known that the 2-variable Tutte polynomials contain chromatic polynomial and flow polynomial of graphs, i.e. the cases of $y=0$ and $x=0$. In 2013, K\'{a}lm\'{a}n introduced the interior and exterior polynomials which generalized…
In this paper, we derive novel formulas and identities connecting Cauchy numbers and polynomials with both ordinary and generalized Stirling numbers, binomial coefficients, central factorial numbers, Euler polynomials, $r$-Whitney numbers,…
Continuous generalizations of the Fibonacci sequence satisfy ODEs that are formal analogues of the Friedmann equation describing spatially homogeneous and isotropic cosmology in general relativity. These analogies are presented, together…
The coefficients c(n,k) defined by (1-k^2x)^(-1/k) = sum c(n,k) x^n reduce to the central binomial coefficients for k=2. Motivated by a question of H. Montgomery and H. Shapiro for the case k=3, we prove that c(n,k) are integers and study…
In this paper we use a formula for the $n$-th power of a $2\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive…
In this paper, we get the generating functions of q-Chebyshev polynomials using operator. Also considering explicit formulas of q-Chebyshev polynomials, we give new generalizations of q-Chebyshev polynomials called incomplete q-Chebyshev…
Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…
A combinatorial proof of the unimodality of the generalized q-Gaussian coefficients based on the explicit formula for Kostka-Foulkes polynomials is given.
We give a survey of some known and some new results about factors of different sorts of $q-$Fibonacci numbers.
We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…
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…
In this paper, we define new generalized k-Mersenne numbers and give a formula of generalized Mersenne polynomials and further we study their properties. Moreover, we define Gaussian Mersenne numbers and obtain some identities like Binet…
The Fibonomial coefficients are well-known analogues of the classical binomial coefficients. In 2009, Sagan and Savage introduced a combinatorial interpretation for these coefficients, based on tiling a rectangular grid. More recently,…
A second order polynomial sequence is of Fibonacci-type $\mathcal{F}_{n}$ (Lucas-type $\mathcal{L}_{n}$) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Under certain conditions these polynomials are…
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…
The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…