图重写代数
The algebras of graph rewriting
摘要:
本文将在~ \cite{blasiak2010combinatorial}中为描述Heisenberg-Weyl代数而引入的形式的图解组合Hopf代数的概念推广到表示图重写规则及其组合的所谓规则图的情况。由此产生的规则图代数可以通过四种不同的方式被适当地限制为我们所称的规则代数,这些规则代数是实现图重写规则的组合的代数的非交换的、有单位的关联代数。值得注意的是,我们的框架表明,存在两种以上的类型的图重写系统比以前已知的文献中,我们提出了一个分析的规则代数的结构,以及一种形式的庞加莱-伯克霍夫-维特定理的规则图代数。我们的工作奠定了基础,从根本上分析图形变换系统的新方法,并嵌入这个非常重要的概念,从理论计算机科学牢固地到数学组合学和统计物理学领域。
英文摘要:
The concept of diagrammatic combinatorial Hopf algebras in the form introduced for describing the Heisenberg-Weyl algebra in~\cite{blasiak2010combinatorial} is extended to the case of so-called rule diagrams that present graph rewriting rules and their composites. The resulting rule diagram algebra may then be suitably restricted in four different ways to what we call the rule algebras, which are non-commutative, unital associative algebras that implement the algebra of compositions of graph rewriting rules. Notably, our framework reveals that there exist two more types of graph rewriting systems than previously known in the literature, and we present an analysis of the structure of the rule algebras as well as a form of Poincaré-Birkhoff-Witt theorem for the rule diagram algebra. Our work lays the foundation for a fundamentally new way of analyzing graph transformation systems, and embeds this very important concept from theoretical computer science firmly into the realm of mathematical combinatorics and statistical physics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。