 |
Discrete Mathematics & Theoretical Computer Science |
Kassie Archer - Descents of $\lambda$-unimodal cyclic permutations
dmtcs:2411 - Discrete Mathematics & Theoretical Computer Science, January 1, 2014, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) - https://doi.org/10.46298/dmtcs.2411Descents of $\lambda$-unimodal cyclic permutationsArticle
- 1 Department of Mathematics [Dartmouth]
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: 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
Imported 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]
Consultation statistics
This page has been seen 292 times.
This article's PDF has been downloaded 390 times.