A new criterion for M, N-adhesivity, with an application to hierarchical graphs
A new criterion for M, N-adhesivity, with an application to hierarchical graphs
复制标题
M、N-粘附性的新标准及其在分层图上的应用
DOI：
--
复制
发表时间：
2022
期刊：
影响因子：
--
通讯作者：
Marino Miculan
中科院分区：
文献类型：
--
作者：
Davide Castelnovo;F. Gadducci;Marino Miculan
粘接范畴为重写理论的代数方法提供了一个抽象的框架，其中许多一般结果可以被改写和统一证明。然而，检查模型是否满足粘合性能有时远非立竿见影。本文给出了$\mathcal{M}, $ mathcal{N}$-黏附性的一个充分条件，推广了原有的黏附性概念。我们将其应用于几个现有的类别，特别是层次图，这是一种众所周知的难以适应代数方法重写模型的形式，并且有各种替代定义浮动。
Adhesive categories provide an abstract framework for the algebraic approach to rewriting theory, where many general results can be recast and uniformly proved. However, checking that a model satisfies the adhesivity properties is sometimes far from immediate. In this paper we present a new criterion giving a sufficient condition for $\mathcal{M}, \mathcal{N}$-adhesivity, a generalisation of the original notion of adhesivity. We apply it to several existing categories, and in particular to hierarchical graphs, a formalism that is notoriously difficult to fit in the mould of algebraic approaches to rewriting and for which various alternative definitions float around.