Combinatorics in the group of parity alternating permutations

Details Combinatorics in the group of parity alternating permutations Combinatorics in the group of parity alternating permutations

2008-12-10

arxiv.org/abs/0812.1839v1

Mathematics

Combinatorics

9 pages

Scientific paper

We call a permutation parity alternating, if its entries assume even and odd integers alternately. Parity alternating permutations form a subgroup of the symmetric group. This paper deals with such permutations classified by two permutation statistics; the numbers of ascents and inversions. It turns out that they have a close relationship to signed Eulerian numbers. The approach is based on a study of the set of permutations that are not parity alternating. It is proved that the number of even permutations is equal to that of odd ones among such permutations with the same ascent number. Hence signed Eulerian numbers can be described by parity alternating permutations. Divisibility properties for the cardinalities of certain related sets are also deduced.

Affiliated with

Also associated with

No associations

Rating

Combinatorics in the group of parity alternating 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 Combinatorics in the group of parity alternating permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorics in the group of parity alternating permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527150