2014/01/10 by Archer, Kassie
#05A05 #05E10 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1401.2433
We prove an identity conjectured by Adin and Roichman involving the descent set of λ-unimodal cyclic permutations. These permutations appear in formulas for characters of certain representations of the symmetric group. Such formulas have previously been proven algebraically. In this paper, we present a combinatorial proof for one such formula and discuss the consequences for the distribution of the descent set on cyclic permutations.