Computing All Maps into a Sphere

DOI10.1145/2597629zbMath1295.68196OpenAlexW1995509853WikidataQ105334126 ScholiaQ105334126MaRDI QIDQ3189652

Lukáš Vokřínek, Francis Sergeraert, Marek Krčál, Martin Čadek, Ji{ří} Matoušek, Uli Wagner

Publication date: 12 September 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2597629

zbMATH Keywords

computational topologyhomotopy groupsPostnikov systems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Homotopy groups, general; sets of homotopy classes (55Q05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (12)

Algorithmic solvability of the lifting-extension problem ⋮ Solving equations and optimization problems with uncertainty ⋮ On computability and triviality of well groups ⋮ Computing homotopy classes for diagrams ⋮ Strong computable type ⋮ Rational homotopy type and computability ⋮ Decidability of the extension problem for maps into odd-dimensional spheres ⋮ Cohomology with local coefficients and knotted manifolds ⋮ Are two given maps homotopic? An algorithmic viewpoint ⋮ Computing all maps into a sphere ⋮ Computing simplicial representatives of homotopy group elements ⋮ Sparse Kneser graphs are Hamiltonian

Uses Software

• polymake

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survey article: an elementary illustrated introduction to simplicial sets
• Finite computability of Postnikov complexes
• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• Stable homotopy groups of spheres. A computer-assisted approach
• The computability problem in algebraic topology
• An algorithm computing homotopy groups.
• Constructive algebraic topology
• Algorithmic unsolvability of the triviality problem for multidimensional knots
• Simplification techniques for maps in simplicial topology
• Computing spectral sequences
• Cohomology operations, and obstructions to extending continuous functions
• Algebraic models for homotopy types
• Cohomology and continuous mappings
• Products of cocycles and extensions of mappings
• Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable
• Topology and data
• Topology for Computing
• Computability Theory and Differential Geometry
• Algorithmic topology and classification of 3-manifolds
• Simplicial homotopy theory
• Simplicial homotopy theory

This page was built for publication: Computing All Maps into a Sphere