Reciprocals of exponential polynomials and permutation enumeration
From MaRDI portal
Abstract: We show that the reciprocal of a partial sum with 2m terms of the alternating exponential series is the exponential generating function for permutations in which every increasing run has length congruent to 0 or 1 modulo 2m. More generally we study polynomials whose reciprocals are exponential generating functions for permutations whose run lengths are restricted to certain congruence classes, and extend these results to noncommutative symmetric functions that count words with the same restrictions on run lengths.
Recommendations
Cites work
Cited in
(13)- A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
- Homomorphisms on noncommutative symmetric functions and permutation enumeration
- Counting permutations by runs
- Exponential Riordan arrays and permutation enumeration
- scientific article; zbMATH DE number 3891453 (Why is no real title available?)
- A combinatorial proof of a result for permutation pairs
- Permutation polynomials with exponents in an arithmetic progression
- Plethystic Exponential Calculus and Characteristic Polynomials of Permutations
- Integral representation of certain combinatorial recurrences
- scientific article; zbMATH DE number 7120844 (Why is no real title available?)
- Moments of an exponential functional of random walks to permutations with given descent sets
- Reciprocals of thinned exponential series
- Increasing trees and the degree-chromatic polynomial
This page was built for publication: Reciprocals of exponential polynomials and permutation enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197602)