Arc permutations

19Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. This paper studies combinatorial properties and structures on these permutations. First, both sets are characterized by pattern avoidance. It is also shown that arc permutations carry a natural affine Weyl group action, and that the number of geodesics between a distinguished pair of antipodes in the associated Schreier graph, and the number of maximal chains in the weak order on unimodal permutations, are both equal to twice the number of standard Young tableaux of shifted staircase shape. Finally, a bijection from non-unimodal arc permutations to Young tableaux of certain shapes, which preserves the descent set, is described and applied to deduce a conjectured character formula of Regev. © 2013 Springer Science+Business Media New York.

Cite

CITATION STYLE

APA

Elizalde, S., & Roichman, Y. (2014). Arc permutations. Journal of Algebraic Combinatorics, 39(2), 301–334. https://doi.org/10.1007/s10801-013-0449-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free