Diameter of the commutation classes graph of a permutation

DOI10.1016/J.EJC.2022.103525MaRDI QIDQ2136208zbMATHOpenAlexFDO

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

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

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)

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.

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

Cites work

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

Cited in

(5)

• A characterization of one-element commutation classes
• Commutation classes of double wiring diagrams
• Commutation classes of the reduced words for the longest element of \(\mathfrak{S}_{n}\)
• Diameter of a commutation class on reduced words
• The commutation graph for the longest signed permutation

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)