A note on the total number of cycles of even and odd permutations

Details A note on the total number of cycles of even and odd permutations A note on the total number of cycles of even and odd permutations

2009-09-03

arxiv.org/abs/0909.0683v2

Discrete Math., 310 (2010) 1398-1400

Mathematics

Combinatorics

4 pages, 2 figures, final version

Scientific paper

We prove bijectively that the total number of cycles of all even permutations of $[n]=\{1,2,...,n\}$ and the total number of cycles of all odd permutations of $[n]$ differ by $(-1)^n(n-2)!$, which was stated as an open problem by Mikl\'{o}s B\'{o}na. We also prove bijectively the following more general identity: $$\sum_{i=1}^n c(n,i)\cdot i \cdot (-k)^{i-1} = (-1)^k k! (n-k-1)!,$$ where $c(n,i)$ denotes the number of permutations of $[n]$ with $i$ cycles.

Affiliated with

Also associated with

No associations

Rating

A note on the total number of cycles of even and odd permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on the total number of cycles of even and odd permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on the total number of cycles of even and odd permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-664076