Rational homotopy type and computability

07/21/2020
by   Fedor Manin, et al.
0

Given a simplicial pair (X,A), a simplicial complex Y, and a map f:A → Y, does f have an extension to X? We show that for a fixed Y, this question is algorithmically decidable for all X, A, and f if and only if Y has the rational homotopy type of an H-space. As a corollary, many questions related to bundle structures over a finite complex are decidable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/21/2020

Zolotarev's fifth and sixth problems

In an influential 1877 paper, Zolotarev asked and answered four question...
research
02/27/2018

How to generate all possible rational Wilf-Zeilberger pairs?

A Wilf--Zeilberger pair (F, G) in the discrete case satisfies the equati...
research
02/16/2021

ε-Arithmetics for Real Vectors

In this paper, we introduce a new concept, namely ϵ-arithmetics, for rea...
research
07/12/2023

Fast and stable rational approximation of generalized hypergeometric functions

Rational approximations of generalized hypergeometric functions _pF_q of...
research
04/08/2014

Rational Counterfactuals

This paper introduces the concept of rational countefactuals which is an...
research
01/22/2016

The Singularity Controversy, Part I: Lessons Learned and Open Questions: Conclusions from the Battle on the Legitimacy of the Debate

This report seeks to inform policy makers on the nature and the merit of...
research
02/22/2018

On Rational Delegations in Liquid Democracy

Liquid democracy is a proxy voting method where proxies are delegable. W...

Please sign up or login with your details

Forgot password? Click here to reset