作者: Vincent Pilaud
DOI:
关键词:
摘要: We describe a canonical spanning tree of the ridge graph subword complex on finite Coxeter group. It is based properties greedy facets in complexes, defined and studied this paper. Searching yields an enumeration scheme for complex. This algorithm extends flip pointed pseudotriangulations points or convex bodies plane.