scholarly journals The multiparameter r-Whitney numbers

Filomat ◽  
2019 ◽  
Vol 33 (3) ◽  
pp. 931-943 ◽  
Author(s):  
B. El-Desouky ◽  
F.A. Shiha ◽  
Ethar Shokr
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Matrix Representation ◽  
Stirling Numbers ◽  
Combinatorial Identities ◽  
Harmonic Numbers ◽  
Explicit Formulas ◽  
Whitney Numbers ◽  
Special Cases ◽  
Generalized Stirling Numbers

In this paper, we define the multiparameter r-Whitney numbers of the first and second kind. The recurrence relations, generating functions , explicit formulas of these numbers and some combinatorial identities are derived. Some relations between these numbers and generalized Stirling numbers of the first and second kind, Lah numbers, C-numbers and harmonic numbers are deduced. Furthermore, some interesting special cases are given. Finally matrix representation for these relations are given.

New family of Whitney numbers

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 309-320 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad Cakic ◽  
F.A. Shiha
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Explicit Formulas ◽  
Basic Properties ◽  
New Family ◽  
Whitney Numbers ◽  
Special Cases

In this paper we give a new family of numbers, called ??-Whitney numbers, which gives generalization of many types of Whitney numbers and Stirling numbers. Some basic properties of these numbers such as recurrence relations, explicit formulas and generating functions are given. Finally many interesting special cases are derived.

scholarly journals Explicit Formulas for the First Form (q,r)-Dowling Numbers and (q,r)-Whitney-Lah Numbers

2021 ◽  
Vol 14 (1) ◽  
pp. 65-81
Author(s):  
Roberto Bagsarsa Corcino ◽  
Jay Ontolan ◽  
Maria Rowena Lobrigas
Keyword(s):  
Recurrence Relation ◽  
Explicit Formula ◽  
Taylor Series ◽  
Generating Functions ◽  
Recurrence Relations ◽  
Difference Operator ◽  
Interpolation Formula ◽  
Explicit Formulas ◽  
Fundamental Properties ◽  
Whitney Numbers

In this paper, a q-analogue of r-Whitney-Lah numbers, also known as (q,r)-Whitney-Lah number, denoted by $L_{m,r} [n, k]_q$ is defined using the triangular recurrence relation. Several fundamental properties for the q-analogue are established such as vertical and horizontal recurrence relations, horizontal and exponential generating functions. Moreover, an explicit formula for (q, r)-Whitney-Lah number is derived using the concept of q-difference operator, particularly, the q-analogue of Newton’s Interpolation Formula (the umbral version of Taylor series). Furthermore, an explicit formula for the first form (q, r)-Dowling numbers is obtained which is expressed in terms of (q,r)-Whitney-Lah numbers and (q,r)-Whitney numbers of the second kind.

scholarly journals A q-analogue of α־-Whitney numbers

2018 ◽  
Vol 12 (1) ◽  
pp. 178-191 ◽  
Author(s):  
B.S. El-Desouky ◽  
F.A. Shiha
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Explicit Formulas ◽  
Basic Properties ◽  
Whitney Numbers

We define the (q,??)-Whitney numbers which are reduced to the ??-Whitney numbers when q ? 1. Moreover, we obtain several properties of these numbers such as explicit formulas, recurrence relations, generating functions, orthogonality and inverse relations. Finally, we define the ??-Whitney-Lah numbers as a generalization of the r-Whitney-Lah numbers and we introduce their important basic properties.

scholarly journals The Number of Ways to Assemble a Graph

10.37236/2644 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Andrew Vince ◽  
Miklós Bóna
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Explicit Formulas ◽  
Future Directions ◽  
Macromolecular Assembly ◽  
Open Questions ◽  
Asymptotic Formulae ◽  
Special Cases ◽  
Assembly Problem ◽  
Precise Asymptotic

Motivated by the question of how macromolecules assemble,the notion of an assembly tree of a graph is introduced. Given a graph $G$, the paper is concerned with enumerating the number of assembly trees of $G$, a problem that applies to the macromolecular assembly problem. Explicit formulas or generating functions are provided for the number of assembly trees of several families of graphs, in particular for what we call $(H,\phi)$-graphs.  In some natural special cases, we use a powerful recent result of Zeilberger and Apagodu to provide recurrence relations for the diagonal of the relevant multivariate generating functions, and we use a result of Wimp and Zeilberger to find very precise asymptotic formulae for the coefficients of these diagonals.  Future directions for reseach, as well as open questions, are suggested.

Explicit Formulas and Combinatorial Identities for Generalized Stirling Numbers

2012 ◽  
Vol 10 (1) ◽  
pp. 57-72 ◽  
Author(s):  
Nenad P. Cakić ◽  
Beih S. El-Desouky ◽  
Gradimir V. Milovanović
Keyword(s):  
Stirling Numbers ◽  
Combinatorial Identities ◽  
Explicit Formulas ◽  
Generalized Stirling Numbers

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.

scholarly journals On a generalization of a waiting time problem and some combinatorial identities

2015 ◽  
Vol 52 (04) ◽  
pp. 981-989
Author(s):  
B. S. El-desouky ◽  
F. A. Shiha ◽  
A. M. Magar
Keyword(s):  
Waiting Time ◽  
Probability Function ◽  
Stirling Numbers ◽  
Combinatorial Identities ◽  
Special Cases ◽  
Time Problem ◽  
Probability Of Success ◽  
Waiting Time Problem ◽  
Finite Memory ◽  
Generalized Harmonic Numbers

In this paper we give an extension of the results of the generalized waiting time problem given by El-Desouky and Hussen (1990). An urn contains m types of balls of unequal numbers, and balls are drawn with replacement until first duplication. In the case of finite memory of order k, let ni be the number of type i, i = 1, 2, …, m. The probability of success pi = ni/N, i = 1, 2, …, m, where ni is a positive integer and Let Ym,k be the number of drawings required until first duplication. We obtain some new expressions of the probability function, in terms of Stirling numbers, symmetric polynomials, and generalized harmonic numbers. Moreover, some special cases are investigated. Finally, some important new combinatorial identities are obtained.

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 Multifarious Results for q-Hermite Based Frobenius Type Eulerian Polynomials

2019 ◽  
Author(s):  
Waseem Khan ◽  
Idrees Ahmad Khan ◽  
Mehmet Acikgoz ◽  
Ugur Duran
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Recurrence Relations ◽  
Series Representation ◽  
Bernoulli Polynomials ◽  
Stirling Numbers ◽  
Eulerian Polynomials ◽  
New Class ◽  
Genocchi Polynomials

In this paper, a new class of q-Hermite based Frobenius type Eulerian polynomials is introduced by means of generating function and series representation. Several fundamental formulas and recurrence relations for these polynomials are derived via different generating methods. Furthermore, diverse correlations including the q-Apostol-Bernoulli polynomials, the q-Apostol-Euler poynoomials, the q-Apostol-Genocchi polynomials and the q-Stirling numbers of the second kind are also established by means of the their generating functions.

Sign in / Sign up

Export Citation Format

Share Document