scientific article; zbMATH DE number 1391727
Eulerian numbers, denoted \(C_k^m\) by the authors, may be defined by: \[ C_1^m= C_m^m= 1, \quad C_k^m= (m+1-k) C_{k-1}^{m-1}+ kC_k^{m-1} \] for \(2\leq k\leq m-1\). The authors consider a second collection of numbers, denoted \(D_k^m\), and defined by: \[ D_1^m=1, \quad D_m^m= m!, \quad D_k^m= k(D_{k-1}^{m-1}+ D_k^{m-1}) \] for \(2\leq k\leq m-1\). They explore the combinatorial meaning of the \(D_k^m\), and obtain identities for the \(D_k^m\) that correspond to analogous identities for the \(C_k^m\). In addition, they derive formulas that yield the \(C_k^m\) in terms of the \(D_k^m\) and vice versa.
- A study of Eulerian numbers by means of an operator on permutations
- Propriétés arithmétiques de certains nombres Eulériens
- Polynomial interpolation and sums of powers of integers
- An operator on permutations and its application to Eulerian numbers
- Enumerative proof of a curious congruence for Eulerian numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4936069)