Enumeration of permutations by number of alternating runs
From MaRDI portal
Publication:385736
DOI10.1016/j.disc.2013.05.010zbMath1277.05005arXiv1110.5014OpenAlexW2113755102MaRDI QIDQ385736
Publication date: 3 December 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.5014
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Symmetric groups (20B30)
Related Items (18)
The peak statistics on simsun permutations ⋮ \(q\)-log-convexity from linear transformations and polynomials with only real zeros ⋮ Context-free grammars, generating functions and combinatorial arrays ⋮ Counting permutations by simsun successions ⋮ A grammatical calculus for peaks and runs of permutations ⋮ Context-free grammars for several polynomials associated with Eulerian polynomials ⋮ Counting signed permutations by their alternating runs ⋮ ENUMERATION OF A DUAL SET OF STIRLING PERMUTATIONS BY THEIR ALTERNATING RUNS ⋮ Several variants of the Dumont differential system and permutation statistics ⋮ Subalgebras of Solomon's descent algebra based on alternating runs ⋮ Enumeration of type \(D\) permutations with alternating runs ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ Run Distribution Over Flattened Partitions ⋮ David-Barton type identities and alternating run polynomials ⋮ Eulerian pairs and Eulerian recurrence systems ⋮ The \(1 / k\)-Eulerian polynomials and \(k\)-Stirling permutations ⋮ Normal ordering problem and the extensions of the Stirling grammar ⋮ Some combinatorial arrays related to the Lotka-Volterra system
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An explicit formula for the number of permutations with a given number of alternating runs
- Derivative polynomials and enumeration of permutations by number of interior and left peaks
- Counting simsun permutations by descents
- Context-free grammars, differential operators and formal power series
- Longest alternating subsequences of permutations
- Enriched \(P\)-partitions and peak algebras
- On certain combinatorial expansions of the Eulerian polynomials
- \(q\)-Eulerian polynomials and polynomials with only real zeros
- Affine descents and the Steinberg torus
- William Chen grammars and derivations in trees and arborescences
- A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
- On the \(cd\)-variation polynomials of André and Simsun permutations
- A family of two-variable derivative polynomials for tangent and secant
- Functions with derivatives given by polynomials in the function itself or a related function
- Counting permutations by their alternating runs
- Some combinatorial arrays generated by context-free grammars
- Combinatorics of Permutations
- Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations
- Andre Permutations, Lexicographic Shellability and the cd-Index of a Convex Polytope
- Derivative Polynomials for Tangent and Secant
- Minimax trees and André polynomials
This page was built for publication: Enumeration of permutations by number of alternating runs
