Diameter of the commutation classes graph of a permutation
DOI10.1016/j.ejc.2022.103525zbMath1487.05078arXiv2202.07313OpenAlexW4221112386MaRDI QIDQ2136208
Ricardo Mamede, José Luis Santos, Gonçalo Gutierres
Publication date: 10 May 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.07313
integer partitionsEuler's partition theoremSylvester's bijectionlecture Hall partitionspartition bijectionsratio of successive parts
Permutations, words, matrices (05A05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Repetition in reduced decompositions
- On the distance between the expressions of a permutation
- On the number of reduced decompositions of elements of Coxeter groups
- Some combinatorial properties of Schubert polynomials
- Rhombic tilings of polygons and classes of reduced words in Coxeter groups
- Balanced labellings and Schubert polynomials
- Enumerations relating braid and commutation classes
- Balanced tableaux
- A theorem on higher Bruhat orders
- Commutation classes of the reduced words for the longest element of \(\mathfrak{S}_{n}\)
- The range of repetition in reduced decompositions
- Fan realizations of type \(A\) subword complexes and multi-associahedra of rank 3
- Higher Bruhat orders and cyclic hyperplane arrangements
- An inversion statistic for reduced words
- Diameter of graphs of reduced words and galleries
- Combinatorics of Coxeter Groups
- The cyclic structure of unimodal permutations
This page was built for publication: Diameter of the commutation classes graph of a permutation