On graphs of sets of reduced words

DOI10.54550/ECA2024V4S3R24MaRDI QIDQ6659994

Jennifer Elder

Publication date: 9 January 2025

Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)

zbMATH Keywords

graphpermutationrecursive formulareduced wordweak order lattice

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Braid moves in commutation classes of the symmetric group
• Note on the expected number of Yang-Baxter moves applicable to reduced decompositions.
• On the number of reduced decompositions of elements of Coxeter groups
• Rhombic tilings of polygons and classes of reduced words in Coxeter groups
• Enumerations relating braid and commutation classes
• A formula for enumerating permutations with a fixed pinnacle set
• Interval structures in the Bruhat and weak orders
• Diameters of graphs on reduced words of \(12\) and \(21\)-inflations
• Inflations of geometric grid classes of permutations
• Pattern avoidance and the Bruhat order.
• Diameter of graphs of reduced words and galleries.
• On the expected number of commutations in reduced words
• 312-Avoiding reduced valid hook configurations and duck words
• Diameters of graphs of reduced words and rank-two root subsystems
• Permutations with given peak set
• Homomesies on permutations: An analysis of maps and statistics in the FindStat database

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 Q6659994)