Abstract
In this paper, we study the generating polynomials obtained by enumerating signed and even-signed simsun permutations by number of descents. Properties of the polynomials, including the recurrence relations and generating functions are studied.
| Original language | English |
|---|---|
| Pages (from-to) | 287-302 |
| Number of pages | 16 |
| Journal | Journal of Automata, Languages and Combinatorics |
| Volume | 22 |
| Issue number | 4 |
| DOIs | |
| State | Published - 2017 |