An order on circular permutations

DOI10.37236/9982MaRDI QIDQ6351205arXivFDO

Authors Antoine Abram, Nathan Chapelier-Laget, Christophe Reutenauer

Publication date 13 October 2020

Published in arXiv

Full work available at URL https://doi.org/10.37236/9982

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

arXiv classification

math.CO

Abstract: Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an interval in the affine symmetric group $ilde{S}_n$ with the weak order. The poset is a semidistributive lattice, and the rank function, whose range is cubic in $n$, is computed by some special formula involving inversions. We prove also some links with Eulerian numbers, triangulations of an $n$-gon, and Young's lattice.

This page was built for publication: An order on circular permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6351205)