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
- 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
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Introduction to partially ordered patterns
- Longest alternating subsequences of permutations
- Noncommutative symmetric functions
- Variations on descents and inversions in permutations
Cited in
(37)- A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
- Shuffle-compatible permutation statistics
- Jacobian elliptic functions and a family of bivariate peak polynomials
- A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
- Plethystic formulas for permutation enumeration
- An asymptotic distribution theory for Eulerian recurrences with applications
- David-Barton type identities and alternating run polynomials
- Homomorphisms on noncommutative symmetric functions and permutation enumeration
- \(\gamma\)-positivity and partial \(\gamma\)-positivity of descent-type polynomials
- Hopping from Chebyshev polynomials to permutation statistics
- Eulerian polynomials and descent statistics
- Counting permutations by their alternating runs
- Triangular recurrences, generalized Eulerian numbers, and related number triangles
- Enumeration of a dual set of Stirling permutations by their alternating runs
- scientific article; zbMATH DE number 4033761 (Why is no real title available?)
- Enumerating permutations by their run structure
- Counting permutations by alternating descents
- Reciprocals of exponential polynomials and permutation enumeration
- Counting permutations by cyclic peaks and valleys
- Counting permutations with no long monotone subsequence via generating trees and the kernel method
- The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials
- A grammatical calculus for peaks and runs of permutations
- Stirling permutation codes
- scientific article; zbMATH DE number 7732129 (Why is no real title available?)
- Positivity of Narayana polynomials and Eulerian polynomials
- Reciprocals of thinned exponential series
- On kernels of descent statistics
- Counting and signed counting permutations by descent-based statistics
- New equidistributions on plane trees and decompositions of 132-avoiding permutations
- On the joint distributions of succession and Eulerian statistics
- Two-sided permutation statistics via symmetric functions
- Desarrangements revisited: statistics and pattern avoidance
- Stirling permutation codes. II
- Determinantal representations of enumerative polynomials
- Patterns in multi-dimensional permutations
- The (, )-Eulerian polynomials and descent-Stirling statistics on permutations
- Subalgebras of Solomon's descent algebra based on alternating runs
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)
