Bijective Enumeration and Sign-Imbalance for Permutation Depth and Excedances

Sen Peng Eu, Tung Shan Fu, Yuan Hsun Lo

Research output: Contribution to journalConference articlepeer-review

Abstract

We present a simplified variant of Biane’s bijection between permutations and 3-colored Motzkin paths with weight that keeps track of the inversion number, excedance number and a statistic so-called depth of a permutation. This generalizes a result by Guay-Paquet and Petersen about a continued fraction of the generating function for depth on the symmetric group Sn of permutations. In terms of weighted Motzkin path, we establish an involution on Sn that reverses the parities of depth and excedance numbers simultaneously, which proves that the numbers of permutations with even and odd depth (excedance numbers, respectively) are equal if n is even and differ by the tangent number if n is odd. Moreover, we present some interesting sign-imbalance results on permutations and derangements, refined with respect to depth and excedance numbers.

Original languageEnglish
Pages (from-to)87-91
Number of pages5
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume403
DOIs
Publication statusPublished - 2024 Jun 24
Event13th Conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, GASCom 2024 - Bordeaux, France
Duration: 2024 Jun 242024 Jun 28

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Bijective Enumeration and Sign-Imbalance for Permutation Depth and Excedances'. Together they form a unique fingerprint.

Cite this