Fundamental Group Algorithm for low dimensional tessellated CW complexes

Abstract

We present a detailed description of a fundamental group algorithm based on Forman's combinatorial version of Morse theory. We use this algorithm in a classification problem of prime knots up to 14 crossings.

Cited by in corpus (2)

• Morse theory for group presentations
• Conley-Morse-Forman theory for combinatorial multivector fields