scholarly journals Some Properties of the(p,q)-Fibonacci and(p,q)-Lucas Polynomials

2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
GwangYeon Lee ◽  
Mustafa Asci
Keyword(s):  
Generating Functions ◽  
Combinatorial Identities ◽  
Fibonacci Polynomials ◽  
Lucas Polynomials ◽  
Pascal Matrix ◽  
Riordan Arrays ◽  
Combinatorial Sums

Riordan arrays are useful for solving the combinatorial sums by the help of generating functions. Many theorems can be easily proved by Riordan arrays. In this paper we consider the Pascal matrix and define a new generalization of Fibonacci polynomials called(p,q)-Fibonacci polynomials. We obtain combinatorial identities and by using Riordan method we get factorizations of Pascal matrix involving(p,q)-Fibonacci polynomials.

scholarly journals n-Color partitions with weighted differences equal to minus two

1997 ◽  
Vol 20 (4) ◽  
pp. 759-768 ◽  
Author(s):  
A. K. Agarwal ◽  
R. Balasubrananian
Keyword(s):  
Explicit Expression ◽  
Generating Functions ◽  
Recurrence Relations ◽  
Combinatorial Identities ◽  
Combinatorial Identity ◽  
Divisor Function ◽  
Open Problems

In this paper we study thosen-color partitions of Agarwal and Andrews, 1987, in which each pair of parts has weighted difference equal to−2Results obtained in this paper for these partitions include several combinatorial identities, recurrence relations, generating functions, relationships with the divisor function and computer produced tables. By using these partitions an explicit expression for the sum of the divisors of odd integers is given. It is shown how these partitions arise in the study of conjugate and self-conjugaten-color partitions. A combinatorial identity for self-conjugaten-color partitions is also obtained. We conclude by posing several open problems in the last section.

On Gauss Fibonacci polynomials, on Gauss Lucas polynomials and their applications

2019 ◽  
Vol 48 (3) ◽  
pp. 952-960 ◽  
Author(s):  
Engin Özkan ◽  
Merve Taştan
Keyword(s):  
Fibonacci Polynomials ◽  
Lucas Polynomials

Location of Zeros of Chromatic and Related Polynomials of Graphs

1994 ◽  
Vol 46 (1) ◽  
pp. 55-80 ◽  
Author(s):  
Francesco Brenti ◽  
Gordon F. Royle ◽  
David G. Wagner
Keyword(s):  
Generating Functions ◽  
Sufficient Conditions ◽  
Combinatorial Identities ◽  
Chromatic Polynomials ◽  
Real Zeros ◽  
Location Of Zeros ◽  
Theoretical Results

AbstractWe consider the location of zeros of four related classes of polynomials, one of which is the class of chromatic polynomials of graphs. All of these polynomials are generating functions of combinatorial interest. Extensive calculations indicate that these polynomials often have only real zeros, and we give a variety of theoretical results which begin to explain this phenomenon. In the course of the investigation we prove a number of interesting combinatorial identities and also give some new sufficient conditions for a polynomial to have only real zeros.

Combinatorial sums through Riordan arrays

2011 ◽  
Vol 101 (1-2) ◽  
pp. 195-210 ◽  
Author(s):  
Renzo Sprugnoli
Keyword(s):  
Riordan Arrays ◽  
Combinatorial Sums

scholarly journals Generating Functions for New Families of Combinatorial Numbers and Polynomials: Approach to Poisson–Charlier Polynomials and Probability Distribution Function

Axioms ◽  
2019 ◽  
Vol 8 (4) ◽  
pp. 112 ◽  
Author(s):  
Irem Kucukoglu ◽  
Burcin Simsek ◽  
Yilmaz Simsek
Keyword(s):  
Probability Distribution ◽  
Generating Functions ◽  
Stirling Numbers ◽  
Bernoulli Numbers ◽  
Distribution Functions ◽  
Binomial Coefficients ◽  
Bell Polynomials ◽  
Exponential Polynomials ◽  
Charlier Polynomials ◽  
Combinatorial Sums

The aim of this paper is to construct generating functions for new families of combinatorial numbers and polynomials. By using these generating functions with their functional and differential equations, we not only investigate properties of these new families, but also derive many new identities, relations, derivative formulas, and combinatorial sums with the inclusion of binomials coefficients, falling factorial, the Stirling numbers, the Bell polynomials (i.e., exponential polynomials), the Poisson–Charlier polynomials, combinatorial numbers and polynomials, the Bersntein basis functions, and the probability distribution functions. Furthermore, by applying the p-adic integrals and Riemann integral, we obtain some combinatorial sums including the binomial coefficients, falling factorial, the Bernoulli numbers, the Euler numbers, the Stirling numbers, the Bell polynomials (i.e., exponential polynomials), and the Cauchy numbers (or the Bernoulli numbers of the second kind). Finally, we give some remarks and observations on our results related to some probability distributions such as the binomial distribution and the Poisson distribution.

Fibonacci and Lucas polynomials

1981 ◽  
Vol 90 (3) ◽  
pp. 385-387 ◽  
Author(s):  
B. G. S. Doman ◽  
J. K. Williams
Keyword(s):  
Difference Equation ◽  
Chebyshev Polynomials ◽  
Generating Functions ◽  
Hypergeometric Functions ◽  
Linear Difference Equation ◽  
Second Order ◽  
Lucas Numbers ◽  
Order Linear ◽  
Lucas Polynomials ◽  
Fibonacci And Lucas Numbers

The Fibonacci and Lucas polynomials Fn(z) and Ln(z) are denned. These reduce to the familiar Fibonacci and Lucas numbers when z = 1. The polynomials are shown to satisfy a second order linear difference equation. Generating functions are derived, and also various simple identities, and relations with hypergeometric functions, Gegenbauer and Chebyshev polynomials.

COUNTING ELEMENTS IN THE SYMMETRIC GROUP

2009 ◽  
Vol 19 (03) ◽  
pp. 305-313 ◽  
Author(s):  
DAVID EL-CHAI BEN-EZRA
Keyword(s):  
Symmetric Group ◽  
Finite Groups ◽  
Generating Functions ◽  
Symmetric Groups ◽  
Combinatorial Identities ◽  
Subgroup Growth

By using simple ideas from subgroup growth of pro-finite groups we deduce some combinatorial identities on generating functions counting various elements in symmetric groups.

scholarly journals Symmetric and generating functions of generalized (p,q)-numbers

2021 ◽  
Vol 48 (4) ◽  
Author(s):  
Nabiha Saba ◽  
◽  
Ali Boussayoud ◽  
Abdelhamid Abderrezzak ◽  
◽  
...  
Keyword(s):  
Generating Functions ◽  
Fibonacci Numbers ◽  
Lucas Numbers ◽  
Pell Numbers ◽  
Lucas Polynomials ◽  
Binet’S Formula

In this paper, we will firstly define a new generalization of numbers (p, q) and then derive the appropriate Binet's formula and generating functions concerning (p,q)-Fibonacci numbers, (p,q)- Lucas numbers, (p,q)-Pell numbers, (p,q)-Pell Lucas numbers, (p,q)-Jacobsthal numbers and (p,q)-Jacobsthal Lucas numbers. Also, some useful generating functions are provided for the products of (p,q)-numbers with bivariate complex Fibonacci and Lucas polynomials.

scholarly journals Eulerian Numbers Associated with Arithmetical Progressions

10.37236/7182 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
José L. Ramírez ◽  
Sergio N. Villamarin ◽  
Diego Villamizar
Keyword(s):  
Generating Functions ◽  
Combinatorial Identities ◽  
Combinatorial Interpretation ◽  
Eulerian Numbers ◽  
Signed Permutations ◽  
Whitney Numbers

In this paper, we give a combinatorial interpretation of the $r$-Whitney-Eulerian numbers by means of coloured signed permutations. This sequence is a generalization of the well-known Eulerian numbers and it is connected to $r$-Whitney numbers of the second kind. Using generating functions, we provide some combinatorial identities and the log-concavity property. Finally, we show some basic congruences involving the $r$-Whitney-Eulerian numbers.

scholarly journals Some New Identities for the Generalized Fibonacci Polynomials by the Q(x) Matrix

2021 ◽  
Vol 13 (2) ◽  
pp. 21
Author(s):  
Chung-Chuan Chen ◽  
Lin-Ling Huang
Keyword(s):  
Fibonacci Polynomials ◽  
New Approach ◽  
Lucas Polynomials ◽  
Type Formula ◽  
Type Identity ◽  
Fibonacci Polynomial

We obtain some new identities for the generalized Fibonacci polynomial by a new approach, namely, the Q(x) matrix. These identities including the Cassini type identity and Honsberger type formula can be applied to some polynomial sequences such as Fibonacci polynomials, Lucas polynomials, Pell polynomials, Pell-Lucas polynomials and so on, which generalize the previous results in references.

Sign in / Sign up

Export Citation Format

Share Document