Word posets, with applications to Coxeter groups

Details Word posets, with applications to Coxeter groups Word posets, with applications to Coxeter groups

2011-08-18

arxiv.org/abs/1108.3638v1

EPTCS 63, 2011, pp. 226-230

Computer Science

Discrete Mathematics

In Proceedings WORDS 2011, arXiv:1108.3412

Scientific paper

10.4204/EPTCS.63.28

We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then apply the partially ordered sets to Coxeter groups. Some results are a proof that enumerating the reduced words of elements of Coxeter groups is #P-complete, a recursive formula for computing the number of commutation classes of reduced words, as well as stronger bounds on the maximum number of commutation classes than were previously known. This also allows us to improve the known bounds on the number of primitive sorting networks.

Affiliated with

Also associated with

No associations

Rating

Word posets, with applications to Coxeter groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Word posets, with applications to Coxeter groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Word posets, with applications to Coxeter groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180652