Diameter of the commutation classes graph of a permutation

DOI10.1016/J.EJC.2022.103525zbMATH Open1487.05078arXiv2202.07313OpenAlexW4221112386MaRDI QIDQ2136208FDOQ2136208

Ricardo Mamede, José Luis Santos, Gonçalo Gutierres

Publication date: 10 May 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We define a statistic on the graph of commutation classes of a permutation of the symmetric group which is used to show that these graphs are equipped with a ranked poset structure, with a minimum and maximum. This characterization also allows us to compute the diameter of the commutation graph for any permutation, from which the results for the longest permutation and for fully commutative permutations are recovered.

Full work available at URL: https://arxiv.org/abs/2202.07313

Recommendations

• The commutation graph for the longest signed permutation
• Diameters of graphs on reduced words of \(12\) and \(21\)-inflations
• Commutation classes of the reduced words for the longest element of \(\mathfrak{S}_{n}\)
• scientific article; zbMATH DE number 1151857
• Commutation classes of double wiring diagrams

zbMATH Keywords

integer partitionsEuler's partition theoremSylvester's bijectionlecture Hall partitionspartition bijectionsratio of successive parts

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Cites Work

• Combinatorics of Coxeter Groups
• Some combinatorial properties of Schubert polynomials
• Title not available (Why is that?)
• On the number of reduced decompositions of elements of Coxeter groups
• A theorem on higher Bruhat orders
• Higher Bruhat orders and cyclic hyperplane arrangements
• Diameter of graphs of reduced words and galleries.
• Title not available (Why is that?)
• Fan realizations of type \(A\) subword complexes and multi-associahedra of rank 3
• The cyclic structure of unimodal permutations
• Balanced tableaux
• Balanced labellings and Schubert polynomials
• Rhombic tilings of polygons and classes of reduced words in Coxeter groups
• The range of repetition in reduced decompositions
• Repetition in reduced decompositions
• On the distance between the expressions of a permutation
• Commutation classes of the reduced words for the longest element of \(\mathfrak{S}_{n}\)
• Enumerations relating braid and commutation classes
• An inversion statistic for reduced words

Cited In (3)

• Diameter of a commutation class on reduced words
• The commutation graph for the longest signed permutation
• A characterization of one-element commutation classes

This page was built for publication: Diameter of the commutation classes graph of a permutation

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