On Graphs of Sets of Reduced Words

MaRDI QIDQ6389644zbMATH OpenFDO

Authors Jennifer Elder

Publication date 30 January 2022

Abstract: Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i=(ii+1)$. For a fixed permutation $sigmainmathfrak{S}_n$ the products of minimal length are called reduced decompositions or reduced words, and the collection of all such reduced words is denoted $R(sigma)$. Any reduced word of $sigma$ can be transformed into any other by a sequence of commutation moves or long braid moves. One area of interest in these sets are the congruence classes defined by using only braid or only commutation relations. The set $R(sigma)$ can be drawn as a graph, $G(sigma)$, where the vertices are the reduced words, and the edges denote the presence of a commutation or braid move between the words. This paper will present brand new work on subgraph structures in $G(sigma)$, as well as new formulas to count the number of braid edges and commutation edges in $G(sigma)$. We will also include work on bounds for $|B(sigma)|$ and $|C(sigma)|$.

This page was built for publication: On Graphs of Sets of Reduced Words

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