English
Related papers

Related papers: Extendability of continuous maps is undecidable

200 papers

The global extendibility of smooth causal geodesically incomplete spacetimes is investigated. Denote by $\gamma$ one of the incomplete non-extendible causal geodesics of a causal geodesically incomplete spacetime $(M,g_{ab})$. First, it is…

General Relativity and Quantum Cosmology · Physics 2010-06-29 István Rácz

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Logic in Computer Science · Computer Science 2012-10-10 Domenico Cantone , Cristiano Longo

Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…

Combinatorics · Mathematics 2025-08-04 Chao Yang , Zhujun Zhang

If $\pi:(X,T)\to(Z,S)$ is a topological factor map between uniquely ergodic topological dynamical systems, then $(X,T)$ is called an isomorphic extension of $(Z,S)$ if $\pi$ is also a measure-theoretic isomorphism. We consider the case when…

Dynamical Systems · Mathematics 2015-02-26 Tomasz Downarowicz , Eli Glasner

This paper tackles the extension problems for three far-unsatble homotopy groups $\pi_{39}(S^{6})$, $\pi_{40}(S^{7})$, and $\pi_{41}(S^{8})$ localized at 2, the puzzles having remained unsolved for forty-five years. By a Toda bracket…

Algebraic Topology · Mathematics 2024-07-08 Juxin Yang , Jie Wu

We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…

Algebraic Topology · Mathematics 2016-01-20 Mark Grant , Gregory Lupton , John Oprea

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…

Combinatorics · Mathematics 2013-04-30 David Avis , Hans Raj Tiwary

Given two graphs G and H, there is a bi-resolving (or bi-covering) graph homomorphism from G to H if and only if their adjacency matrices satisfy certain matrix relations. We investigate the bi-covering extensions of bi-resolving…

Dynamical Systems · Mathematics 2013-11-26 Uijin Jung , In-Je Lee

Let $X$ be a compact metric space which is locally absolutely retract and let $\phi: C(X)\to C(Y, M_n)$ be a unital homomorphism, where $Y$ is a compact metric space with ${\rm dim}Y\le 2.$ It is proved that there exists a sequence of $n$…

Operator Algebras · Mathematics 2009-09-10 Huaxin Lin

We consider extension variants of the classical graph problems Vertex Cover and Independent Set. Given a graph $G=(V,E)$ and a vertex set $U \subseteq V$, it is asked if there exists a minimal vertex cover (resp.\ maximal independent set)…

Computational Complexity · Computer Science 2018-10-12 Katrin Casel , Henning Fernau , Mehdi Khosravian Ghadikolaei , Jérôme Monnot , Florian Sikora

We study the problem of extending a complex structure to a given Lie algebra g, which is firstly defined on an ideal h of g. We consider the next situations: h is either complex or it is totally real. The next question is to equip g with an…

Differential Geometry · Mathematics 2014-06-17 Rutwig Campoamor Stursberg , Isolda E. Cardoso , Gabriela P. Ovando

For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…

Symbolic Computation · Computer Science 2024-10-08 Sergei Abramov , Gleb Pogudin

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel , Alexander Schwartz

In this paper we extend certain central results of zero dimensional systems to higher dimensions. The first main result shows that if (Y,f) is a finitely presented system, then there exists a Smale space (X,F) and a u-resolving factor map…

Dynamical Systems · Mathematics 2009-10-02 Todd Fisher

We prove that any closed map between metrizable spaces can be extended to a closed map between completely metrizable spaces with the same extensional dimension.

General Topology · Mathematics 2007-05-23 H. Murat Tuncali , E. D. Tymchatin , Vesko Valov

Reachability for piecewise affine systems is known to be undecidable, starting from dimension $2$. In this paper we investigate the exact complexity of several decidable variants of reachability and control questions for piecewise affine…

Computational Complexity · Computer Science 2017-01-18 Hugo Bazille , Olivier Bournez , Walid Gomaa , Amaury Pouly

We prove the projective plane $\rp^2$ is an absolute extensor of a finite-dimensional metric space $X$ if and only if the cohomological dimension mod 2 of $X$ does not exceed 1. This solves one of the remaining difficult problems (posed by…

Geometric Topology · Mathematics 2014-10-01 Jerzy Dydak , Michael Levin

Let X be a complex nonsingular affine algebraic variety, K a holomorphically convex subset of X, and Y a homogeneous variety for some complex linear algebraic group. We prove that a holomorphic map f:K-->Y can be uniformly approximated on K…

Complex Variables · Mathematics 2020-12-23 Jacek Bochnak , Wojciech Kucharz

Given CW complexes X and Y, let map(X,Y) denote the space of continuous functions from X to Y with the compact open topology. The space map(X,Y) need not have the homotopy type of a CW complex. Here the results of an extensive investigation…

Algebraic Topology · Mathematics 2007-08-22 Jaka Smrekar

A theory of numerical path-following in toric varieties was suggested in two previous papers. The motivation is solving systems of polynomials with real or complex coefficients. When those polynomials are not assumed 'dense', solving them…

Algebraic Geometry · Mathematics 2025-06-23 Gregorio Malajovich