Computing all maps into a sphere

DOI10.1145/2597629MaRDI QIDQ3189652zbMATH OpenOpenAlexWikidataFDO

Authors Martin Čadek, Marek Krčál, Francis Sergeraert, Lukáš Vokřínek, 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

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

Recommendations

• Computing all maps into a sphere
• Extending continuous maps, polynomiality and undecidability
• Extendability of continuous maps is undecidable
• Computing simplicial representatives of homotopy group elements
• Decidability of the extension problem for maps into odd-dimensional spheres

Cites work

• Algebraic models for homotopy types
• Algorithmic topology and classification of 3-manifolds
• Algorithmic unsolvability of the triviality problem for multidimensional knots
• An algorithm computing homotopy groups.
• Cohomology and continuous mappings
• Cohomology operations, and obstructions to extending continuous functions
• Computability Theory and Differential Geometry
• Computational topology. An introduction
• Computing spectral sequences
• Constructive algebraic topology
• Embedding and knotting of manifolds in Euclidean spaces
• Finite computability of Postnikov complexes
• scientific article; zbMATH DE number 412172 (Why is no real title available?)
• scientific article; zbMATH DE number 3114412 (Why is no real title available?)
• scientific article; zbMATH DE number 3144942 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3631581 (Why is no real title available?)
• scientific article; zbMATH DE number 1254302 (Why is no real title available?)
• scientific article; zbMATH DE number 1342334 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• scientific article; zbMATH DE number 2191967 (Why is no real title available?)
• scientific article; zbMATH DE number 3246969 (Why is no real title available?)
• scientific article; zbMATH DE number 3086775 (Why is no real title available?)
• scientific article; zbMATH DE number 3090996 (Why is no real title available?)
• Persistent homology -- a survey
• polymake: a framework for analyzing convex polytopes
• Products of cocycles and extensions of mappings
• Satisfiability of systems of equations of real analytic functions is quasi-decidable
• Simplicial homotopy theory
• Simplicial homotopy theory
• Simplification techniques for maps in simplicial topology
• Stable homotopy groups of spheres. A computer-assisted approach
• Survey article: an elementary illustrated introduction to simplicial sets
• The computability problem in algebraic topology
• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• Topology and data
• Topology for Computing

Cited in

(20)

• Solving equations and optimization problems with uncertainty
• Cohomology with local coefficients and knotted manifolds
• Are two given maps homotopic? An algorithmic viewpoint
• Computing simplicial representatives of homotopy group elements
• Algorithmic solvability of the lifting-extension problem
• Extendability of continuous maps is undecidable
• Mappings of the sphere to a simply connected space
• On computability and triviality of well groups
• Sparse Kneser graphs are Hamiltonian
• Decidability of the extension problem for maps into odd-dimensional spheres
• Extending continuous maps, polynomiality and undecidability
• Computing all maps into a sphere
• Computing homotopy classes for diagrams
• Strong computable type
• Rational homotopy type and computability
• The complexity of recognizing geometric hypergraphs
• Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete
• Are two H-spaces homotopy equivalent? An algorithmic view point
• The complexity of recognizing geometric hypergraphs
• The computation of megamaps

Describes a project that uses

Uses Software

• polymake

This page was built for publication: Computing all maps into a sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189652)