Related papers: Algorithmic aspects of immersibility and embeddabi…
We define submersions f between manifolds M and N modelled on locally convex spaces. If the range N is finite-dimensional or a Banach manifold, then these coincide with the naive notion of a submersion. We study pre-images of submanifolds…
We investigate the manifold $\cal{M}$ of (real) quadratic forms in n > 1 variables having a multiple eigenvalue. In addition to known facts, we prove that 1) $\cal{M}$ is irreducible, 2) in the case of n = 3, scalar matrices and only them…
We show that the following algorithmic problem is decidable: given a $2$-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in $\mathbf{R}^3$? By a known reduction, it suffices to decide…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…
We use pinched smooth hyperbolization to show that every closed, nonpositively curved $n$-dimensional manifold $M$ can be embedded as a totally geodesic submanifold of a closed, nonpositively curved $(n+1)$-dimensional manifold $\hat{M}$ of…
We prove that an m-dimensional unit ball D^m in the Euclidean space {\mathbb R}^m cannot be isometrically embedded into a higher-dimensional Euclidean ball B_r^d \subset {\mathbb R}^d of radius r < 1/2 unless one of two conditions is met --…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
An immersion of a smooth $n$-dimensional manifold $M \to \mathbb{R}^q$ is called totally nonparallel if, for every distinct $x, y \in M$, the tangent spaces at $f(x)$ and $f(y)$ contain no parallel lines. Given a manifold $M$, we seek the…
Under a set of assumptions on a family of submanifolds $\subset {\mathbb R}^D$, we derive a series of geometric properties that remain valid after finite-dimensional and almost isometric Diffusion Maps (DM), including almost uniform…
A closed 3-manifold $M$ may be described up to some indeterminacy by a Heegaard diagram $\mathcal{D}$. The question "Does $M$ smoothly embed in $\mathbb{R}^4$?'' is equivalent to a property of $\mathcal{D}$ which we call $\textit{doubly…
We analyse the complexity of the satisfiability problem ssmSAT for State Space Models (SSM), which asks whether an input sequence can lead the model to an accepting configuration. We find that ssmSAT is undecidable in general, reflecting…
We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly non-simple) closed curve on the boundary of M, decide whether this curve is contractible in M. Our algorithm runs in space polynomial in…
This article is concerned with locally flatly immersed surfaces in simply-connected $4$-manifolds where the complement of the surface has fundamental group $\mathbb{Z}$. Once the genus and number of double points are fixed, we classify such…
It is undecidable whether the language recognized by a probabilistic finite automaton is empty. Several other undecidability results, in particular regarding problems about matrix products, are based on this important theorem. We present…
The study of word equations (or the existential theory of equations over free monoids) is a central topic in mathematics and theoretical computer science. The problem of deciding whether a given word equation has a solution was shown to be…
Several natural partial orders on integral partitions, such as the embeddability, the stable embeddability, the bulk embeddability and the supermajorization, raise in the quantum computation, bin-packing and matrix analysis. We find the…
The problem of attempting to learn the mapping between data and labels is the crux of any machine learning task. It is, therefore, of interest to the machine learning community on practical as well as theoretical counts to consider the…
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula…
Let M and N be smooth manifolds without boundary. Immersion theory suggests that an understanding of the space of smooth embeddings emb(M,N) should come from an analysis of the cofunctor V |--> emb(V,N) from the poset O of open subsets of M…