{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:17:50Z","timestamp":1759335470552,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A permutation $\\sigma$ of the multiset $\\{1,1,2,2,\\ldots,n,n\\}$ is called a Stirling permutation of order $n$ if $\\sigma_s&gt;\\sigma_i$ as long as $\\sigma_i=\\sigma_j$ and $i&lt;s &lt;j$. In this paper, we present a unified refinement of the ascent polynomials and the ascent-plateau polynomials of Stirling permutations. In particular, by using Foata and Strehl's group action, we prove that the pairs of statistics (left ascent-plateau, ascent) and (left ascent-plateau, plateau) are equidistributed over Stirling permutations of given order, and we show the $\\gamma$-positivity of the enumerative polynomial of left ascent-plateaus, double ascents and descent-plateaus. A connection between the $\\gamma$-coefficients of this enumerative polynomial and Eulerian numbers is also established.<\/jats:p>","DOI":"10.37236\/8008","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T02:08:34Z","timestamp":1578622114000},"source":"Crossref","is-referenced-by-count":5,"title":["The Ascent-Plateau Statistics on Stirling Permutations"],"prefix":"10.37236","volume":"26","author":[{"given":"Shi-Mei","family":"Ma","sequence":"first","affiliation":[]},{"given":"Jun","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Yeong-Nan","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2019,4,5]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i2p5\/7817","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i2p5\/7817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T23:15:13Z","timestamp":1579216513000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i2p5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,5]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2019,4,5]]}},"URL":"https:\/\/doi.org\/10.37236\/8008","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2019,4,5]]},"article-number":"P2.5"}}