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 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.

scholarly journals Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations

10.37236/1481 ◽  
2000 ◽  
Vol 7 (1) ◽  
Author(s):  
Niklas Eriksen ◽  
Henrik Eriksson ◽  
Kimmo Eriksson
Keyword(s):  
Golden Ratio ◽  
Upper Bounds ◽  
Combinatorial Interpretation ◽  
Eulerian Numbers ◽  
Signed Permutations

We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the $q$-Eulerian identities of Brenti and some generalizations. In particular, we prove an identity involving the golden ratio, which allows us to compute upper bounds on how high a checker can reach in a classical checker-jumping problem, when the rules are relaxed to allow also diagonal jumps.

scholarly journals Derivative Polynomials, Euler Polynomials, and Associated Integer Sequences

10.37236/1453 ◽  
1999 ◽  
Vol 6 (1) ◽  
Author(s):  
Michael E. Hoffman
Keyword(s):  
Generating Functions ◽  
Root Systems ◽  
Class Numbers ◽  
Euler Polynomials ◽  
Combinatorial Interpretation ◽  
Integer Sequences ◽  
Rational Argument ◽  
Signed Permutations ◽  
Secant Numbers

Let $P_n$ and $Q_n$ be the polynomials obtained by repeated differentiation of the tangent and secant functions respectively. From the exponential generating functions of these polynomials we develop relations among their values, which are then applied to various numerical sequences which occur as values of the $P_n$ and $Q_n$. For example, $P_n(0)$ and $Q_n(0)$ are respectively the $n$th tangent and secant numbers, while $P_n(0)+Q_n(0)$ is the $n$th André number. The André numbers, along with the numbers $Q_n(1)$ and $P_n(1)-Q_n(1)$, are the Springer numbers of root systems of types $A_n$, $B_n$, and $D_n$ respectively, or alternatively (following V. I. Arnol'd) count the number of "snakes" of these types. We prove this for the latter two cases using combinatorial arguments. We relate the values of $P_n$ and $Q_n$ at $\sqrt3$ to certain "generalized Euler and class numbers" of D. Shanks, which have a combinatorial interpretation in terms of 3-signed permutations as defined by R. Ehrenborg and M. A. Readdy. Finally, we express the values of Euler polynomials at any rational argument in terms of $P_n$ and $Q_n$, and from this deduce formulas for Springer and Shanks numbers in terms of Euler polynomials.

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 Jacobi Ensemble, Hurwitz Numbers and Wilson Polynomials

2021 ◽  
Vol 111 (3) ◽  
Author(s):  
Massimo Gisonni ◽  
Tamara Grava ◽  
Giulio Ruzza
Keyword(s):  
Generating Functions ◽  
Combinatorial Interpretation ◽  
Hurwitz Numbers ◽  
Jacobi Ensemble ◽  
Matrix Ensembles ◽  
Wilson Polynomials ◽  
Unitary Ensemble ◽  
Topological Expansion

AbstractWe express the topological expansion of the Jacobi Unitary Ensemble in terms of triple monotone Hurwitz numbers. This completes the combinatorial interpretation of the topological expansion of the classical unitary invariant matrix ensembles. We also provide effective formulæ for generating functions of multipoint correlators of the Jacobi Unitary Ensemble in terms of Wilson polynomials, generalizing the known relations between one point correlators and Wilson polynomials.

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.

Hankel Transform of the Type 2 (p,q)-Analogue of r-Dowling Numbers

Axioms ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 343
Author(s):  
Roberto Corcino ◽  
Mary Ann Ritzell Vega ◽  
Amerah Dibagulun
Keyword(s):  
Hankel Transform ◽  
Convolution Type ◽  
Combinatorial Interpretation ◽  
Whitney Numbers

In this paper, type 2 (p,q)-analogues of the r-Whitney numbers of the second kind is defined and a combinatorial interpretation in the context of the A-tableaux is given. Moreover, some convolution-type identities, which are useful in deriving the Hankel transform of the type 2 (p,q)-analogue of the r-Whitney numbers of the second kind are obtained. Finally, the Hankel transform of the type 2 (p,q)-analogue of the r-Dowling numbers are established.

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.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document