Abstract
In a recent work of Savage and Viswanathan (2012), during studies of the set of n-dimensional k-inversion sequences, the so-called 1/k-Eulerian polynomials have been introduced, which are given as generating polynomials of the number of ascents in such inversion sequences. In this paper, we discover that the 1/k-polynomials are also generating polynomials of the number of the longest ascent plateaus of k-Stirling permutations. Moreover, we also introduce the dual set of Stirling permutations.
Original language | English |
---|---|
Pages (from-to) | 1468-1472 |
Number of pages | 5 |
Journal | Discrete Mathematics |
Volume | 338 |
Issue number | 8 |
DOIs | |
State | Published - 6 Aug 2015 |
Bibliographical note
Publisher Copyright:© 2015 Elsevier B.V. All rights reserved.
Keywords
- 1 / k-Eulerian polynomials
- Alternating runs
- Longest ascent plateaus
- k-Stirling permutations
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics