A grammatical calculus for peaks and runs of permutations
From MaRDI portal
Publication:6098207
DOI10.1007/s10801-023-01219-5zbMath1516.05005arXiv2210.12325MaRDI QIDQ6098207
Publication date: 13 June 2023
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.12325
context-free grammarsincreasing treesalternating permutationsup-down runsgrammatical calculuspeak polynomials
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Counting permutations by runs
- Context-free grammars for permutations and increasing trees
- Enumeration of permutations by number of alternating runs
- Derivative polynomials and enumeration of permutations by number of interior and left peaks
- Context-free grammars, differential operators and formal power series
- Longest alternating subsequences of permutations
- William Chen grammars and derivations in trees and arborescences
- Generating functions of permutations with respect to their alternating runs
- Tangent numbers and operators
- Combinatorics of Permutations
- A Survey of Alternating Permutations
- Increasing trees and alternating permutations
- The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials
This page was built for publication: A grammatical calculus for peaks and runs of permutations