We prove an identity conjectured by Adin and Roichman involving the descent set of $\lambda$-unimodal cyclic permutations. These permutations appear in the character formulas for certain representations of the symmetric group and these formulas are usually proven algebraically. Here, we give a combinatorial proof for one such formula and discuss the consequences for the distribution of the descent set on cyclic permutations.

Source : oai:HAL:hal-01207601v1

Volume: DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)

Section: Proceedings

Published on: January 1, 2014

Submitted on: November 21, 2016

Keywords: necklaces,descent,cyclic permutation,characters of representations of the symmetric group.,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

This page has been seen 25 times.

This article's PDF has been downloaded 94 times.