Algorithmic aspects of immersibility and embeddability

12/21/2018
by   Fedor Manin, et al.
0

We analyze an algorithmic question about immersion theory: for which m, n, and CAT=Diff or PL is the question of whether an m-dimensional CAT-manifold is immersible in R^n decidable? As a corollary, we show that the smooth embeddability of an m-manifold with boundary in R^n is undecidable when n-m is even and 11m ≥ 10n+1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/11/2018

When Locally Linear Embedding Hits Boundary

Based on the Riemannian manifold model, we study the asymptotical behavi...
research
04/28/2015

Can Machines Truly Think

Can machines truly think? This question and its answer have many implica...
research
06/07/2023

Recognition of Seifert fibered spaces with boundary is in NP

We show that the decision problem of recognising whether a triangulated ...
research
12/24/2021

Dimensional Complexity and Algorithmic Efficiency

This paper uses the concept of algorithmic efficiency to present a unifi...
research
01/14/2020

Deciding contractibility of a non-simple curve on the boundary of a 3-manifold: A computational Loop Theorem

We present an algorithm for the following problem. Given a triangulated ...
research
07/24/2013

Cluster Trees on Manifolds

In this paper we investigate the problem of estimating the cluster tree ...
research
03/02/2022

A relationship and not a thing: A relational approach to algorithmic accountability and assessment documentation

Central to a number of scholarly, regulatory, and public conversations a...

Please sign up or login with your details

Forgot password? Click here to reset