Computads and Multitopic Sets

Simple item page
dc.creatorHarnik, Victor
dc.creatorMakkai, Michael
dc.creatorZawadowski, Marek
dc.date2008-11-20
dc.date.accessioned2026-07-07T10:19:41Z
dc.date.available2026-07-07T10:19:41Z
dc.descriptionWe 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.
dc.description53 pages, references added
dc.identifierhttps://arxiv.org/abs/0811.3215
dc.identifierhttp://arxiv.org/abs/0811.3215
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/174600
dc.subjectCategory Theory
dc.subject16B99
dc.titleComputads and Multitopic Sets
dc.typetext

Files

Collections

arXiv