高维子图匹配
Higher-dimensional subdiagram matching
AI总结:
本文研究高维图重写中的子图匹配问题,在 diagrammatic sets 框架下提出任意维度的匹配算法,并证明在无环性条件下可将超多项式复杂度改进为多项式复杂度,同时分析了维度 4 的困难。
摘要:
高维重写建立在重写系统与胞腔复形的对偶性之上,将计算数学与高范畴和同伦论联系起来:一条重写规则的两侧是一个 (n+1)-胞腔边界的两半,它们都是 n-胞腔的图。我们将高维图重写作为一种计算机制来研究,重点关注在 diagrammatic sets 的组合框架内可重写子图的匹配问题。我们基于关于图的层化的新结果,给出了任意维度下子图匹配的算法,并推导出其时间复杂度的上界。我们证明,在某些无环性条件下,这些超多项式上界可以改进为多项式上界,并且这些条件对于维度不超过 3 的图普遍成立。我们讨论了维度 4 中出现的挑战。
英文摘要:
Higher-dimensional rewriting is founded on a duality of rewrite systems and cell complexes, connecting computational mathematics to higher categories and homotopy theory: the two sides of a rewrite rule are two halves of the boundary of an (n+1)-cell, which are diagrams of n-cells. We study higher-dimensional diagram rewriting as a mechanism of computation, focussing on the matching problem for rewritable subdiagrams within the combinatorial framework of diagrammatic sets. We provide an algorithm for subdiagram matching in arbitrary dimensions, based on new results on layerings of diagrams, and derive upper bounds on its time complexity. We show that these superpolynomial bounds can be improved to polynomial bounds under certain acyclicity conditions, and that these conditions hold in general for diagrams up to dimension 3. We discuss the challenges that arise in dimension 4.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。