Computing all maps into a sphere

DOI10.1145/2597629zbMATH Open1295.68196OpenAlexW1995509853WikidataQ105334126 ScholiaQ105334126MaRDI QIDQ3189652FDOQ3189652

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

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

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

zbMATH Keywords

computational topologyhomotopy groupsPostnikov systems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

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

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)