Counting permutations by runs
From MaRDI portal
Publication:285069
DOI10.1016/J.JCTA.2016.04.002zbMATH Open1336.05010arXiv1505.02308OpenAlexW2237129737MaRDI QIDQ285069FDOQ285069
Authors: Yan Zhuang 
Publication date: 18 May 2016
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1505.02308
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05)
Cites Work
- Title not available (Why is that?)
- Noncommutative symmetric functions
- Combinatorics of permutations
- Title not available (Why is that?)
- Variations on descents and inversions in permutations
- A combinatorial proof of a result of Gessel and Greene
- Enumeration of permutations of \((1, \ldots, n)\) by number of maxima
- A Coloring Problem
- Decomposition Based Generating Functions for Sequences
- Counting permutations by alternating descents
- Longest alternating subsequences of permutations
- Introduction to partially ordered patterns
Cited In (32)
- Reciprocals of thinned exponential series
- Positivity of Narayana polynomials and Eulerian polynomials
- Title not available (Why is that?)
- \(\gamma\)-positivity and partial \(\gamma\)-positivity of descent-type polynomials
- A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
- Shuffle-compatible permutation statistics
- On kernels of descent statistics
- A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
- An asymptotic distribution theory for Eulerian recurrences with applications
- Counting permutations by alternating descents
- Eulerian polynomials and descent statistics
- Title not available (Why is that?)
- Counting and signed counting permutations by descent-based statistics
- Plethystic formulas for permutation enumeration
- Counting permutations by their alternating runs
- On the joint distributions of succession and Eulerian statistics
- New equidistributions on plane trees and decompositions of \(132\)-avoiding permutations
- Enumerating permutations by their run structure
- Counting permutations by cyclic peaks and valleys
- Counting permutations with no long monotone subsequence via generating trees and the kernel method
- Stirling permutation codes
- Triangular recurrences, generalized Eulerian numbers, and related number triangles
- Jacobian elliptic functions and a family of bivariate peak polynomials
- Two-sided permutation statistics via symmetric functions
- Subalgebras of Solomon's descent algebra based on alternating runs
- The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials
- Reciprocals of exponential polynomials and permutation enumeration
- A grammatical calculus for peaks and runs of permutations
- Homomorphisms on noncommutative symmetric functions and permutation enumeration
- Enumeration of a dual set of Stirling permutations by their alternating runs
- David-Barton type identities and alternating run polynomials
- Hopping from Chebyshev polynomials to permutation statistics
Uses Software
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)
