Computads with invertible generators for weak ω-categories
范畴论
2026-06-29 v1
摘要
We extend the notion of computads for weak -categories to allow marking certain generators as invertible, and describe inductively the free -categories they generate. This gives a simple, finite description of the walking equivalences, the -categories classifying invertible cells. We then construct a coreflection from generalised to ordinary computads, preserving the generated -categories, and conclude that -categories generated by generalised computads are cofibrant. Finally, we study the subcategory of generalised computads and generator-preserving morphisms, and show that it is a presheaf topos, similarly to the case of ordinary computads.
引用
@article{arxiv.2606.30254,
title = {Computads with invertible generators for weak ω-categories},
author = {Thibaut Benjamin and Camil Champin and Ioannis Markakis},
journal= {arXiv preprint arXiv:2606.30254},
year = {2026}
}