Some combinatorial aspects of reduced words in finite Coxeter groups
Some combinatorial aspects of reduced words in finite Coxeter groups
We analyze the structure of reduced expressions in the Coxeter groups <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A Subscript n"> <mml:semantics> <mml:msub> <mml:mi>A</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>n</mml:mi> </mml:mrow> </mml:msub> <mml:annotation encoding="application/x-tex">A_{n}</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper B Subscript n"> <mml:semantics> <mml:msub> <mml:mi>B</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>n</mml:mi> </mml:mrow> </mml:msub> <mml:annotation encoding="application/x-tex">B_{n}</mml:annotation> …