Complexity reduction for path categories
From MaRDI portal
Publication:6325555
arXiv1909.08433MaRDI QIDQ6325555FDOQ6325555
Authors: J. F. Jardine 
Publication date: 18 September 2019
Abstract: This paper displays complexity reduction techniques for calculations of path categories (or fundamental categories) P(K) for finite simplicial and cubical complexes K. The central technique involves identifying inclusions of complexes for which the induced functor of path categories is fully faithful. Refinements of cubical complex structures are discussed. A first method for parallelizing the calculation of path categories for cubical complexes is introduced.
Simplicial sets and complexes in algebraic topology (55U10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
This page was built for publication: Complexity reduction for path categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325555)
