Related papers: Extendability of continuous maps is undecidable

In this paper, we study length categories using iterated extensions. We consider the problem of classifying all indecomposable objects in a length category, and the problem of characterizing those length categories that are uniserial. We…

The main result given in Theorem~1.1 is a condition for a map $X$, defined on the complement of a disk $D$ in R^2 with values in R^2, to be extended to a topological embedding of R^2, not necessarily surjective. The map $X$ is supposed to…

Let $X=C[0,1]$, and $Y$ be an arbitrary Banach space. Consider a collection of open segments $\{V_i \}\subset X$. Suppose the map $f: \cup_i V_i \to Y$ has $q$ bounded Fr\'echet derivatives ($q=0,1,...,\infty$), and $f$ and all its…

We prove that if A is a large random relational structure with at least one relation of arity at least 2 then the problem EXT(A) is almost surely NP-complete.

Let X and Y be nonsingular real algebraic varieties, dimX>dimY-1. Assume that the variety Y is malleable, compact and connected. Our main result implies that each regular map from X to Y is homotopic to a surjective regular map. The class…

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…

A central problem of algebraic topology is to understand the homotopy groups $\pi_d(X)$ of a topological space $X$. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental…

We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…

Let K be an algebraic function field of characteristic 2 with constant field C_K. Let C be the algebraic closure of a finite field in K. Assume that C has an extension of degree 2. Assume that there are elements u,x of K with u…

The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever…

The problem of approximating the infinite dimensional space of all continuous maps from an algebraic variety $X$ to an algebraic variety $Y$ by finite dimensional spaces of algebraic maps arises in several areas of geometry and mathematical…

We prove that the inclusion of map(X,Y) into map(K(X),K(Y)) is continuous, where K(X) is the space of non-empty compact subsets of X (also known as the hyperspace of compact subsets of X), and both spaces of maps are endowed with the…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…

The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually…

We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…

For a class $\mathcal{H}$ of graphs, #Sub$(\mathcal{H})$ is the counting problem that, given a graph $H\in \mathcal{H}$ and an arbitrary graph $G$, asks for the number of subgraphs of $G$ isomorphic to $H$. It is known that if $\mathcal{H}$…

We study the extension of the Kechris-Solecki-Todorcevic dichotomy on analytic graphs to dimensions higher than 2. We prove that the extension is possible in any dimension, finite or infinite. The original proof works in the case of the…

Arveson's extension theorem guarantees that every completely positive map defined on an operator system can be extended to a completely positive map defined on the whole C*-algebra containing it. An analogous statement where complete…

This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity. A classical…