2013/01/24 by Olcay Coşkun, Coşkun, Olcay, Müge Taşkın +1
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1301.5723
openalex publication_date 2013/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce a partial order on the set of all reduced words of a given permutation ω, called 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 ω.