The greedy flip tree of a subword complex
Abstract
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. This algorithm extends the greedy flip algorithm for pointed pseudotriangulations of points or convex bodies in the plane.
Cite
@article{arxiv.1203.2323,
title = {The greedy flip tree of a subword complex},
author = {Vincent Pilaud},
journal= {arXiv preprint arXiv:1203.2323},
year = {2012}
}
Comments
14 pages, 10 figures; various corrections (in particular deletion of Section 4 which contained a serious mistake pointed out by an anonymous referee). This paper is subsumed by our joint results with Christian Stump on "EL-labelings and canonical spanning trees for subword complexes" (http://arxiv.org/abs/1210.1435) and will therefore not be published