Skip to main content
Log in

The algebra of directed complexes

  • Published:
Applied Categorical Structures Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. I.R. Aitchison: 1986,The Geometry of Oriented Cubes, Macquarie Mathematics Reports 86-0082.

  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 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Steiner, R. The algebra of directed complexes. Appl Categor Struct 1, 247–284 (1993). https://doi.org/10.1007/BF00873990

Download citation

  • Received:

  • Accepted:

  • Issue date:

  • DOI: https://doi.org/10.1007/BF00873990

Mathematics Subject Classification (1991)

Key words