## Combinatorial methods in discrete mathematics

- V N Sachkov
- Combinatorial methods in discrete mathematics
- 1996

We define and study sub-Eulerian polynomials of type D, which count the elements of D n with respect to the number of descents in a refined sense. The recurrence relations and exponential generating functions of the sub-Eulerian polynomials are determined , by which the solution to a problem of Brenti, concerning the recurrence relation for the Eulerian… (More)

### Presentations referencing similar topics