The greedy flip tree of a subword complex

Details The greedy flip tree of a subword complex The greedy flip tree of a subword complex

2012-03-11

arxiv.org/abs/1203.2323v1

Mathematics

Combinatorics

17 pages, 10 figures

Scientific paper

We describe a canonical spanning tree of the ridge graph of a subword complex on a finite Coxeter group. It is based on properties of greedy facets in subword complexes, defined and studied in this paper. Searching this tree yields an enumeration scheme for the facets of the subword complex. Two specific families of subword complexes provide relevant illustrations for this algorithm: on the one hand, this work extends the greedy flip algorithm for pointed pseudotriangulations of points or convex bodies in the plane; on the other hand, it is closely related to Coxeter sorting and Coxeter sortable elements in finite Coxeter groups, which are relevant to generate cluster complexes.

Affiliated with

Also associated with

No associations

Rating

The greedy flip tree of a subword complex 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 The greedy flip tree of a subword complex, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The greedy flip tree of a subword complex will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14503