路径类别的复杂性降低
Complexity reduction for path categories
摘要：
本文给出了计算有限单纯复形和三次复形K的路径范畴（或基本范畴）P（K）的复杂性降低技术。核心技术涉及到识别复杂的道路类别的诱导函子是完全忠实的内含物。讨论了立方复结构的精化。介绍了第一种用于并行计算立体复合体的路径类别的方法。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
