Counting permutations by alternating descents
From MaRDI portal
Publication:470946
zbMath1302.05007arXiv1408.1886MaRDI QIDQ470946
Publication date: 13 November 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.1886
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05)
Related Items (12)
Eulerian polynomials and descent statistics ⋮ Positivity and divisibility of enumerators of alternating descents ⋮ Counting permutations by runs ⋮ Shuffle-compatible permutation statistics ⋮ Some results related to Hurwitz stability of combinatorial polynomials ⋮ Enumeration of permutations by the parity of descent positions ⋮ Enumeration of permutations by number of alternating descents ⋮ Fonctions symétriques et séries hypergéométriques basiques multivariées ⋮ Homomorphisms on noncommutative symmetric functions and permutation enumeration ⋮ Alternating Eulerian polynomials and left peak polynomials ⋮ A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra ⋮ Reciprocals of exponential polynomials and permutation enumeration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variations on descents and inversions in permutations
- A combinatorial application of matrix Riccati equations and their q- analogue
- Noncommutative symmetric functions
- Generating functions for alternating descents and alternating major index
- Combinatorics of Permutations
- A Survey of Alternating Permutations
- Decomposition Based Generating Functions for Sequences
- Permutations with prescribed pattern
This page was built for publication: Counting permutations by alternating descents