Descent classes of permutations with a given number of fixed points
From MaRDI portal
Publication:1318370
DOI10.1016/0097-3165(93)90100-MzbMath0794.05001OpenAlexW2013446610MaRDI QIDQ1318370
Michelle L. Wachs, Désarménien, Jacques
Publication date: 28 August 1994
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(93)90100-m
Related Items
The combinatorics of the bar resolution in group cohomology ⋮ On the combinatorics of derangements and related permutations ⋮ Eulerian quasisymmetric functions ⋮ The symmetric group action on rank-selected posets of injective words ⋮ Spectral analysis of random-to-random Markov chains ⋮ Higher Lie characters and cyclic descent extension on conjugacy classes ⋮ Eulerian quasisymmetric functions for the type B Coxeter group and other wreath product groups ⋮ The \((1-\mathbb{E})\)-transform in combinatorial Hopf algebras ⋮ Euler-Mahonian triple set-valued statistics on permutations ⋮ Higher Lie characters and cyclic descent extension on conjugacy classes ⋮ Signed words and permutations. IV: Fixed and pixed points ⋮ Fix-Mahonian calculus. III: a quadruple distribution ⋮ Fix-Mahonian calculus. II: Further statistics ⋮ On two unimodal descent polynomials ⋮ Permutations with extremal number of fixed points ⋮ Recurrence relations for graph polynomials on bi-iterative families of graphs ⋮ On fixed points of permutations. ⋮ A combinatorial interpretation of the Seidel generation of \(q\)-derangement numbers ⋮ 𝑞-Eulerian polynomials: Excedance number and major index ⋮ Character formulas and descents for the hyperoctahedral group
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on a recursion for the number of derangements
- q-hook length formulas for forests
- A Rogers-Ramanujan bijection
- Counting permutations with given cycle structure and descent set
- Descents of derangements and circular words
- A Bijection in the Theory of Derangements
- On q-Derangement Numbers
- Major Index and Inversion Number of Permutations
- Ordered structures and partitions
