Word posets, complexity, and Coxeter groups

Matthew J. Samuel

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequ…