Combinatorial study on the group of parity alternating permutations

2008/12/10 by Shinji Tanimoto, Tanimoto, Shinji
Engineering · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.0812.1839

openalex publication_date 2008/12/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian numbers have intimate relationships to the set.

Related

• Parity-Alternate Permutations and Signed Eulerian Numbers
• A Survey of Alternating Permutations
• A Combinatorial Proof of the Enumeration of Alternating Permutations with Given Peak Set
• A new refinement of Euler numbers on counting alternating permutations
• A New Approach to Signed Eulerian Numbers