An effective algorithm to get linking numbers of 3-manifolds
From MaRDI portal
Publication:1894689
DOI10.1007/BF01827942zbMath0854.57004OpenAlexW2026263310MaRDI QIDQ1894689
Publication date: 22 January 1997
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/182484
algorithmintersection matrixhomology grouplinking number3-manifoldtorsion coefficientscolored triangulation
Relations of low-dimensional topology with graph theory (57M15) Fundamental group, presentations, free differential calculus (57M05)
Cites Work
- Crystallisation moves
- Graph-encoded 3-manifolds
- Lins-Mandel manifolds as branched coverings of \(S^ 3\)
- A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
- Paintings: a planar approach to higher dimensions
- On the fundamental group of 3-gems and a `planar' class of 3-manifolds
- Crystallisations of 2-Fold Branched Coverings of S 3
- Unnamed Item
- Unnamed Item
This page was built for publication: An effective algorithm to get linking numbers of 3-manifolds