Abstract: In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem to allow for a much wider variety of restrictions on increasing run lengths, and use it to complete the enumeration of permutations with parity restrictions on peaks and valleys, and to give a systematic method for obtaining generating functions for permutation statistics that are expressible in terms of increasing runs. Our methods can also be used to obtain analogous results for alternating runs in permutations.
Recommendations
Cites work
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- A Coloring Problem
- A combinatorial proof of a result of Gessel and Greene
- Combinatorics of permutations
- Counting permutations by alternating descents
- Decomposition Based Generating Functions for Sequences
- Enumeration of permutations of \((1, \ldots, n)\) by number of maxima
- Introduction to partially ordered patterns
- Longest alternating subsequences of permutations
- Noncommutative symmetric functions
- Variations on descents and inversions in permutations
Cited in
(32)- Hopping from Chebyshev polynomials to permutation statistics
- Plethystic formulas for permutation enumeration
- \(\gamma\)-positivity and partial \(\gamma\)-positivity of descent-type polynomials
- The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials
- A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
- scientific article; zbMATH DE number 7732129 (Why is no real title available?)
- Enumeration of a dual set of Stirling permutations by their alternating runs
- Counting and signed counting permutations by descent-based statistics
- New equidistributions on plane trees and decompositions of \(132\)-avoiding permutations
- Counting permutations with no long monotone subsequence via generating trees and the kernel method
- Reciprocals of thinned exponential series
- scientific article; zbMATH DE number 4033761 (Why is no real title available?)
- A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
- Counting permutations by their alternating runs
- Homomorphisms on noncommutative symmetric functions and permutation enumeration
- An asymptotic distribution theory for Eulerian recurrences with applications
- Counting permutations by cyclic peaks and valleys
- Eulerian polynomials and descent statistics
- Two-sided permutation statistics via symmetric functions
- Reciprocals of exponential polynomials and permutation enumeration
- Stirling permutation codes
- Shuffle-compatible permutation statistics
- Counting permutations by alternating descents
- Positivity of Narayana polynomials and Eulerian polynomials
- Subalgebras of Solomon's descent algebra based on alternating runs
- On the joint distributions of succession and Eulerian statistics
- David-Barton type identities and alternating run polynomials
- On kernels of descent statistics
- A grammatical calculus for peaks and runs of permutations
- Triangular recurrences, generalized Eulerian numbers, and related number triangles
- Jacobian elliptic functions and a family of bivariate peak polynomials
- Enumerating permutations by their run structure
This page was built for publication: Counting permutations by runs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285069)
