Omitting parentheses from the cyclic notation
From MaRDI portal
Publication:892114
DOI10.1007/S00009-014-0467-1zbMATH Open1401.06001arXiv1308.0936OpenAlexW2166308976MaRDI QIDQ892114FDOQ892114
Mahir Bilen Can, Yonah Cherniavsky
Publication date: 18 November 2015
Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)
Abstract: The purpose of this article is to initiate a combinatorial study of the Bruhat-Chevalley ordering on certain sets of permutations obtained by omitting the parentheses from their standard cyclic notation. In particular, we show that these sets form a bounded, graded, unimodal, rank-symmetric and EL-shellable posets. Moreover, we determine the homotopy types of the associated order complexes.
Full work available at URL: https://arxiv.org/abs/1308.0936
Recommendations
Permutations, words, matrices (05A05) (q)-calculus and related topics (05A30) Combinatorics of partially ordered sets (06A07)
Cites Work
- Title not available (Why is that?)
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- Classical Bruhat orders and lexicographic shellability
- Bruhat order of Coxeter groups and shellability
- Shellings of spheres and polytopes
- A weight statistic and partial order on products of \(m\)-cycles
- The Bruhat Order of the Symmetric Group is Lexicographically Shellable
- Title not available (Why is that?)
- A statistic on involutions
- Bruhat-Chevalley order on the rook monoid
- EL-labelings, supersolvability and 0-Hecke algebra actions on posets
- Deformations of permutation representations of Coxeter groups.
Cited In (3)
This page was built for publication: Omitting parentheses from the cyclic notation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892114)