Sorting and generating reduced words
Combinatorics
2013-06-20 v2
Abstract
We introduce a partial order on the set of all reduced words of a given permutation , called \emph{directed-braid poset} of . This poset enables us to produce two algorithms: One is a sorting algorithm applied on any reduced word of and aims to obtained the natural word (lexicographically largest reduced word); the other one is a generation algorithm applied on the natural word and aims to obtained the set of all reduced words of .
Cite
@article{arxiv.1301.5723,
title = {Sorting and generating reduced words},
author = {Olcay Coşkun and Müge Taşkın},
journal= {arXiv preprint arXiv:1301.5723},
year = {2013}
}