2012/03/11 by Vincent Pilaud, Pilaud, Vincent · 1 citation
Computer Science · Mathematics · #05C05 #20F55 #68R05 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Geometric and Algebraic Topology #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1203.2323
openalex publication_date 2012/03/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.