2000 character limit reached
Opetopes and chain complexes (1204.6723v2)
Published 30 Apr 2012 in math.CT
Abstract: We give a simple algebraic description of opetopes in terms of chain complexes, and we show how this description is related to combinatorial descriptions in terms of treelike structures. More generally, we show that the chain complexes associated to higher categories generate graphlike structures. The algebraic description gives a relationship between the opetopic approach and other approaches to higher category theory. It also gives an easy way to calculate the sources and targets of opetopes.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.