COUNTING PERMUTATIONS BY NUMBERS OF EXCEDANCES, FIXED POINTS AND CYCLES

DOI10.1017/S0004972711002760zbMath1243.05019OpenAlexW2105602357MaRDI QIDQ2891969

Shi-Mei Ma

Publication date: 18 June 2012

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972711002760

zbMATH Keywords

Stirling numbersrecurrence relations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Related Items (2)

Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Euler-Mahonian statistics on ordered set partitions. II.
• Exceedingly deranging!
• A class of \(q\)-symmetric functions arising from plethysm
• A unified approach to polynomial sequences with only real zeros
• Théorie géométrique des polynômes eulériens
• On linear transformations preserving the Pólya frequency property

This page was built for publication: COUNTING PERMUTATIONS BY NUMBERS OF EXCEDANCES, FIXED POINTS AND CYCLES