The algebra of directed complexes
- 91 Downloads
The theory of directed complexes is a higher-dimensional generalisation of the theory of directed graphs. In a directed graph, the simple directed paths form a subset of the free category which they generate; if the graph has no directed cycles, then the simple directed paths constitute the entire category. Generalising this, in a directed complex there is a class of split subsets which is contained in and generates a free ω-category; when a simple loop-freeness condition is satisfied, the split sets constitute the entire ω-category. The class of directed complexes is closed under the natural product and join constructions. The free ω-categories generated by directed complexes include the important examples associated to cubes and simplexes.
Mathematics Subject Classification (1991)18D05
Key wordsDirected complex parity complex ω-category ∞-category globelike atom molecule split set frame dimension loop-free totally loop-free
Unable to display preview. Download preview PDF.
- 1.I.R. Aitchison: 1986,The Geometry of Oriented Cubes, Macquarie Mathematics Reports 86-0082.Google Scholar
- 2.F.A. Al-Agl and R. Steiner: 1993, ‘Nerves of multiple categories’,Proc. London Math. Soc. (3)66, 92–128.Google Scholar
- 3.R. Brown and P.J. Higgins: 1981, ‘The equivalence of ∞-groupoids and crossed complexes’,Cah. Top. Géom. Diff. 22, 371–386.Google Scholar
- 4.M. Johnson: 1989, ‘The combinatorics of categorical pasting’,J. Pure Appl. Algebra 62, 211–225.Google Scholar
- 5.M.M. Kapranov and V.A. Voevodsky: 1991, ‘Combinatorial-geometric aspects of polycategory theory: pasting schemes and higher Bruhat orders (list of results)’,Cah. Top. Géom. Diff. Catégoriques 32, 11–27.Google Scholar
- 6.A.J. Power: 1991, ‘Ann-categorical pasting theorem’, in A. Carboni, M.C. Pedicchio, and G. Rosolini (eds.),Category Theory, Proc. Int. Conf. Como 1990, Lecture Notes in Mathematics 1488, Springer, Berlin, etc., 326–358.Google Scholar
- 7.V. Pratt: 1991, ‘Modeling concurrency with geometry’, in D. Wise (ed.),Principles of Programming Languages, Proceedings of the eighteenth annual ACM symposium, ACM Press, New York, 311–322.Google Scholar
- 8.R. Street: 1987, ‘The algebra of oriented simplexes’,J. Pure Appl. Algebra 49, 281–335.Google Scholar
- 9.R. Street: 1991, ‘Parity complexes’,Cah. Top. Géom. Diff. Catégoriques 32, 315–343.Google Scholar