Computads和多主题集
Computads and Multitopic Sets
摘要：
我们比较computads与多主题集。这两种结构都有n维对象（分别称为n单元和n粘贴图）。计算集形成了更熟悉的omega-范畴类的一个子类，而多主题集已经被Hermida，Makkai和Power设计为定义弱omega-范畴概念的工具。我们的主要结果表明，多主题集范畴等价于多对一计算子范畴，即所有计算子范畴的某个满子范畴。
英文摘要：
We compare computads with multitopic sets. Both these kinds of structures have n-dimensional objects (called n-cells and n-pasting diagrams, respectively). The computads form a subclass of the more familiar class of omega-categories, while multitopic sets have been devised by Hermida, Makkai and Power as a vehicle for a definition of the concepts of weak omega-category. Our main result states that the category of multitopic sets is equivalent to that of many-to-one computads, a certain full subcategory of the category of all computads.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
