1 citations · 3 across the 19 of their papers we have counts for
19 papers
Eulerian-type polynomials over matchings and matching permutations
Shi-Mei Ma, Sergey Kitaev, Jean Yeh +1
Claesson and Linusson [Proc. Am. Math. Soc., 139 (2011), 435-449] observed that there are n! matchings on [2n] with no left-nestings. Inspired by this result, this paper is devoted…
Symmetric decompositions and Euler-Stirling statistics on Stirling permutations
Shi-Mei Ma, Jianfeng Wang, Guiying Yan +2
The Stirling permutations introduced by Gessel-Stanley have recently received considerable attention. Motivated by Ji's work on -Eulerian polynomials (Sci China Math., 2025)…
Eulerian-type polynomials over Stirling permutations and box sorting algorithm
Shi-Mei Ma, Jun-Ying Liu, Jean Yeh +1
It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order…
Determinantal representations of alternating run polynomials
Shi-Mei Ma, Hong Bian, Jun-Ying Liu +2
Based on a determinantal formula for the higher derivative of a quotient of two functions, we first present the determinantal expressions of Eulerian polynomials and Andre polynomi…
Stirling permutation codes. II
Shi-Mei Ma, Hao Qi, Jean Yeh +1
In the context of Stirling polynomials, Gessel and Stanley introduced the definition of Stirling permutation, which has attracted extensive attention over the past decades. Recentl…
Normal ordered grammars
Shi-Mei Ma, Toufik Mansour, Jean Yeh +1
We introduce the theory of normal ordered grammars, which gives a natural generalization of the normal ordering problem. To illustrate the main idea, we explore normal ordered gram…