Extendability of simplicial maps is undecidable

08/02/2020
by   A. Skopenkov, et al.
0

We present a short proof of the Čadek-Krčál-Matoušek-Vokřínek-Wagner result from the title (in the following form due to Filakovský-Wagner-Zhechev). For any fixed integer l>1 there is no algorithm recognizing the extendability of the identity map of S^l∨ S^l to a PL map X→ S^l∨ S^l of given 2l-dimensional simplicial complex X containing a subdivision of S^l∨ S^l as a given subcomplex. We also exhibit a gap in the Filakovský-Wagner-Zhechev proof that embeddability of complexes is undecidable in codimension >1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2017

Yet Another Proof of the Aperiodicity of Robinson Tiles

Short proof of the aperiodicity of the Robinson tile set....
research
07/08/2022

A new perspective on the fictitious space lemma

In the present contribution we propose a new proof of the so-called fict...
research
07/02/2019

A Short Proof of the Toughness of Delaunay Triangulations

We present a self-contained short proof of the seminal result of Dillenc...
research
06/02/2022

A Multiset Version of Even-Odd Permutations Identity

In this paper, we give a new bijective proof of a multiset analogue of e...
research
08/02/2023

EDMD for expanding circle maps and their complex perturbations

We show that spectral data of the Koopman operator arising from an analy...
research
03/11/2016

A short proof that O_2 is an MCFL

We present a new proof that O_2 is a multiple context-free language. It ...
research
11/15/2017

A bijective proof of the enumeration of maps in higher genus

Bender and Canfield proved in 1991 that the generating series of maps in...

Please sign up or login with your details

Forgot password? Click here to reset