子字复形的贪婪翻转树
The greedy flip tree of a subword complex
摘要:
本文描述了有限Coxeter群上的子字复形的脊图的一个标准生成树。本文基于子字复形中贪婪刻面的性质,定义并研究了它。搜索该树产生子字复合体的面的枚举方案。该算法将贪婪翻转算法推广到平面上点或凸体的点伪三角剖分。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。