Computing path categories of finite directed cubical complexes
A new method is introduced for simplifying finite directed cubical complexes. This construction is effective in the sense that it can be computed relatively efficiently, and it induces a fully faithful inclusion on path categories. The resulting parallelized family of algorithms enables calculations of morphism sets of path categories of such complexes in many cases of practical interest, and working code is provided as a proof of concept.
path category directed topology simplicial sets primary 18g30 secondary 0304