English
Related papers

Related papers: Extendability of continuous maps is undecidable

200 papers

We define and develop a homotopy invariant notion for the sequential topological complexity of a map $f:X\to Y,$ denoted $TC_{r}(f)$, that interacts with $TC_{r}(X)$ and $TC_{r}(Y)$ in the same way Jamie Scott's topological complexity map…

Algebraic Topology · Mathematics 2024-02-22 Nursultan Kuanyshov

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

Group Theory · Mathematics 2007-05-23 Martin R. Bridson

A length-$n$ random sequence $X_1,\ldots,X_n$ in a space $S$ is finitely exchangeable if its distribution is invariant under all $n!$ permutations of coordinates. Given $N > n$, we study the extendibility problem: when is it the case that…

Probability · Mathematics 2016-12-14 Takis Konstantopoulos , Linglong Yuan

Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them to tractable lineages. In our previous work, using…

Databases · Computer Science 2023-04-14 Antoine Amarilli , Pierre Bourhis , Pierre Senellart

We construct homotopically non-trivial maps from the unit m-sphere to the unit (m-1)-sphere with arbitrarily small k-dilation for each k greater than (m + 1)/2. We prove that homotopically non-trivial maps from the unit m-sphere to the unit…

Differential Geometry · Mathematics 2013-05-31 Larry Guth

We give a necessary and sufficient condition for two Hopf algebras presented as central extensions to be isomorphic, in a suitable setting. We then study the question of isomorphism between the Hopf algebras constructed in 0707.0070v1 as…

Quantum Algebra · Mathematics 2010-06-29 Nicolás Andruskiewitsch , Gastón Andrés García

Let $X, Y$ be separable metrizable spaces, where $X$ is noncompact and $Y$ is equipped with an admissible complete metric $d$. We show that the space $C(X,Y)$ of continuous maps from $X$ into $Y$ equipped with the uniform topology is…

General Topology · Mathematics 2009-06-29 Atsushi Yamashita

Usually, for extension of local maps, one uses multiplication by so called bump functions. However, majority of infinite-dimensional linear topological spaces do not have smooth bump functions. Therefore, in \cite{BR} we suggested a new…

Functional Analysis · Mathematics 2018-12-31 Genrich Belitskii , Victoria Rayskin

We define the Homomorphism Extension (HomExt) problem: given a group $G$, a subgroup $M \leq G$ and a homomorphism $\varphi: M \to H$, decide whether or not there exists a homomorphism $\widetilde{\varphi}: G\to H$ extending $\varphi$,…

Data Structures and Algorithms · Computer Science 2018-06-22 Angela Wuu

We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement $\mathcal{A}$ of $x$-monotone pseudosegments in the plane and a pair of points $a,b$ with distinct $x$-coordinates and not on the same pseudosegment,…

Combinatorics · Mathematics 2025-10-02 Jan Kynčl , Jan Soukup

A map $f:X\to Y$ between topological spaces is defined to be {\em scatteredly continuous} if for each subspace $A\subset X$ the restriction $f|A$ has a point of continuity. We show that for a function $f:X\to Y$ from a perfectly paracompact…

Geometric Topology · Mathematics 2011-10-11 T. Banakh , B. Bokalo

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2016-09-07 Wesley Calvert

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

Logic in Computer Science · Computer Science 2025-10-10 Rémi Morvan

Let $F$ be a local field over $\mathbf{Q}_p$ or $\mathbf{F}_p((t))$, and let $D$ be a central simple division algebra over $F$ of degree $d$. In the $p$-adic case, we assume $p>de+1$ where $e$ is the ramification degree over $\mathbf{Q}_p$;…

Number Theory · Mathematics 2021-10-05 Andrew Keisling , Dylan Pentland

Let $X,Y$ be two irreducible subvarieties of the projective space $\mathbb{P}^n$, and $d\geq 1$ an integer number. The main result of this paper is an algorithm to construct {\bf explicitly}, in terms of $d$ and the ideals defining $X$ and…

Algebraic Geometry · Mathematics 2018-07-13 Tuyen Trung Truong

In this paper, we give a purely cohomological interpretation of the extension problem for associative algebras; that is the problem of extending an associative algebra by another associative algebra. We then give a similar interpretation of…

Rings and Algebras · Mathematics 2009-08-26 Alice Fialowski , Michael Penkava

A space $Y$ is called an extension of a space $X$ if $Y$ contains $X$ as a dense subspace. An extension $Y$ of $X$ is called a one-point extension of $X$ if $Y\backslash X$ is a singleton. P. Alexandroff proved that any locally compact…

General Topology · Mathematics 2015-06-25 M. R. Koushesh

Let D be a bounded, finitely connected domain in the complex plane without isolated points in the boundary and let f be a continuous function on the boundary bD. Let F be a continuous extension of f to the closure of D. We prove that f…

Complex Variables · Mathematics 2007-05-23 Josip Globevnik

We review the current state of the art concerning the characterization of traces of the spaces $W^{1, p} (\mathbb{B}^{m-1}\times (0,1), \mathcal{N})$ of Sobolev mappings with values into a compact manifold $\mathcal{N}$. In particular, we…

Analysis of PDEs · Mathematics 2021-07-16 Petru Mironescu , Jean Van Schaftingen

We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved…

Computational Complexity · Computer Science 2016-05-20 Radu Iosif , Arnaud Sangnier
‹ Prev 1 4 5 6 7 8 10 Next ›