Unifying notions of pasting diagrams

zbMath1498.18033arXiv1903.00282MaRDI QIDQ5094691

Simon Forest

Publication date: 4 August 2022

Full work available at URL: https://arxiv.org/abs/1903.00282

zbMATH Keywords

polygraphsstrict omega-categoriespasting schemespasting diagramsaugmented directed complexescomputadsparity complexestorsion-free complexes

Mathematics Subject Classification ID

Strict omega-categories, computads, polygraphs (18N30)

Related Items (3)

An (∞,2)-categorical pasting theorem ⋮ A combinatorial-topological shape category for polygraphs ⋮ A categorical characterization of strong Steiner \(\omega\)-categories

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher-dimensional word problems with applications to equational logic
• The combinatorics of n-categorical pasting
• Limits indexed by category-valued 2-functors
• Omega-categories and chain complexes
• A combinatorial-topological shape category for polygraphs
• Cofibrant objects among higher-dimensional categories
• A formal verification of the theory of parity complexes
• Non-unital polygraphs form a presheaf category

This page was built for publication: Unifying notions of pasting diagrams