Computads and string diagrams for $n$-sesquicategories
Manuel Ara\'ujo

TL;DR
This paper develops a formal framework using computads and string diagrams to represent compositions in $n$-sesquicategories, advancing the understanding of semistrict higher categories.
Contribution
It provides an explicit description of computads for the monad defining $n$-sesquicategories and shows that their category is a presheaf category, enabling string diagram notation.
Findings
Computads form a presheaf category for the monad $T_n^{D^s}$.
String diagrams can represent arbitrary composites in $n$-sesquicategories.
This work advances the theory of string diagrams for semistrict $n$-categories.
Abstract
An -sesquicategory is an -globular set with strictly associative and unital composition and whiskering operations, which are however not required to satisfy the Godement interchange laws which hold in -categories. In arXiv:2202.09293 we showed how these can be defined as algebras over a monad whose operations are simple string diagrams. In this paper, we give an explicit description of computads for the monad and we prove that the category of computads for this monad is a presheaf category. We use this to describe a string diagram notation for representing arbitrary composites in -sesquicategories. This is a step towards a theory of string diagrams for semistrict -categories.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Algebraic structures and combinatorial models
