An algorithm for cellular maps of closed surfaces
Some diagrammatic methods are described and used to reprove some topological results of Kneser, Edmonds and Skora. Considering several types of homomorphisms between surface groups, the authors gave an algorithm to apply certain homotopy equivalences to obtain normal-form maps. These maps are classified into three types. They could be branched coverings, pinchings or maps, collapsing graphs of punctured spheres to graphs immersed in the one-skeleton of the target surface. By means of this algorithm, one can give proofs of algebraic results on homomorphisms between surface groups.
- An algorithm for the determination of graphs associated to fold maps between closed surfaces
- scientific article; zbMATH DE number 469025
- Combinatorial Image Analysis
- Iterating Maps on Cellular Complexes
- An algorithm for the Euclidean cell decomposition of a non-compact strictly convex projective surface
- A combinatorial algorithm for immersed loops in surfaces
- scientific article; zbMATH DE number 4151859
- An algorithm for finding planar surfaces in three-manifolds
- On cellular decomposition of compact surfaces
This page was built for publication: An algorithm for cellular maps of closed surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384139)