Counting permutations by numbers of excedances, fixed points and cycles

Authors

  • Shi-Mei Ma

Keywords:

Excedances, Fixed points, Cycles

Abstract

In this note we present a combinatorial proof of an identity involving the two kinds of Stirling numbers and the numbers of permutations with prescribed numbers of excedances and cycles. Several recurrence relations related to these permutation statistics are also obtained. DOI: 10.1017/S0004972711002760

Published

2012-04-22

Issue

Section

Articles