Rational homotopy type and computability
arXiv:2007.10632 · doi:10.1007/s10208-022-09582-8
Abstract
Given a simplicial pair , a simplicial complex , and a map , does have an extension to ? We show that for a fixed , this question is algorithmically decidable for all , , and if has the rational homotopy type of an H-space. As a corollary, many questions related to bundle structures over a finite complex are likely decidable. Conversely, for all other , the question is at least as hard as certain special cases of Hilbert's tenth problem which are known or suspected to be undecidable.
arXiv comment26 pages. This is a major revision: The former Lemma 7.2 had been proven incorrectly and is now a conjecture, as is one direction of what was previously the main theorem. I have added proofs of a number of special cases as well as an explanation of why the general statement seems very difficult
References in corpus (5)
- Ranks of twists of elliptic curves and Hilbert's Tenth Problem
- Using elliptic curves of rank one towards the undecidability of Hilbert's Tenth Problem over rings of algebraic integers
- Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
- Integral and rational mapping classes
- Fibrewise rational H-spaces