Combinatorial study on the group of parity alternating permutations

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.

Saved in:
Bibliographic Details
Published inarXiv.org
Main Author Tanimoto, Shinji
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 11.06.2017
Subjects
Combinatorial analysis
Inversions
Parity
Permutations
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422