Fundamental Group Algorithm for low dimensional tessellated CW complexes
classification
🧮 math.AT
math.GT
keywords
algorithmfundamentalgroupclassificationcombinatorialcomplexescrossingsdescription
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.