Some combinatorial models for reduced expressions in Coxeter groups

Details Some combinatorial models for reduced expressions in Coxeter groups Some combinatorial models for reduced expressions in Coxeter groups

2011-04-18

arxiv.org/abs/1104.3533v2

Mathematics

Combinatorics

The references have been updated

Scientific paper

Stanley's formula for the number of reduced expressions of a permutation regarded as a Coxeter group element raises the question of how to enumerate the reduced expressions of an arbitrary Coxeter group element. We provide a framework for answering this question by constructing combinatorial objects that represent the inversion set and the reduced expressions for an arbitrary Coxeter group element. The framework also provides a formula for the length of an element formed by deleting a generator from a Coxeter group element. Fan and Hagiwara, et al$.$ showed that for certain Coxeter groups, the short-braid avoiding elements characterize those elements that give reduced expressions when any generator is deleted from a reduced expression. We provide a characterization that holds in all Coxeter groups. Lastly, we give applications to the freely braided elements introduced by Green and Losonczy, generalizing some of their results that hold in simply-laced Coxeter groups to the arbitrary Coxeter group setting.

Affiliated with

Also associated with

No associations

Rating

Some combinatorial models for reduced expressions in 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 Some combinatorial models for reduced expressions in Coxeter groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some combinatorial models for reduced expressions in Coxeter groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72389