2000 character limit reached
Eulerian polynomials, perfect matchings and Stirling permutations of the second kind
Published 5 Jul 2016 in math.CO | (1607.01311v2)
Abstract: In this paper, we first present combinatorial proofs of a kind of expansions of the Eulerian polynomials of types A and B, and then we introduce Stirling permutations of the second kind. In particular, we count Stirling permutations of the second kind by their cycle ascent plateaus, fixed points and cycles.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.