Electronic Communications of the EASST Volume 39 ( 2011 ) Graph Computation Models Selected Revised Papers from the Third International Workshop on Graph Computation Models ( GCM 2010 ) Construction of Pushout Complements in the Category of Hypergraphs
Electronic Communications of the EASST Volume 39 ( 2011 ) Graph Computation Models Selected Revised Papers from the Third International Workshop on Graph Computation Models ( GCM 2010 ) Construction of Pushout Complements in the Category of Hypergraphs
复制标题
Electronic Communications of the EASST Volume 39 ( 2011 ) 图计算模型 第三届国际图计算模型研讨会 ( GCM 2010 ) 超图范畴推出补集的构建
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Jan Stückrath
中科院分区：
文献类型：
--
作者：
M. Heumüller;Salil Joshi;B. König;Jan Stückrath
本文给出了超图范畴中两个给定态射f：A→ B，m：B→ D的全部推出补的具体构造，对于f，m为非内射的情形也是有效的.它是基于生成合适的等价关系。我们还给出了一个组合的解释，并显示如何从组合，如贝尔数，可以恢复著名的系数。此外，我们提出了一个公式，可以用来计算两个给定态射的推出补数。
We describe a concrete construction of all pushout complements for two given morphisms f : A→ B, m : B→ D in the category of hypergraphs, valid also for the case where f ,m are non-injective. It is based on the generation of suitable equivalence relations. We also give a combinatorial interpretation and show how well-known coefficients from combinatorics, such as the Bell numbers, can be recovered. Furthermore we present a formula that can be used to compute the number of pushout complements for two given morphisms.1