Related papers: Algorithmic aspects of immersibility and embeddabi…

We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…

For each composite number $n\ne 2^k$, there does not exist a single connected closed $(n+1)$-manifold such that any smooth, simply-connected, closed $n$-manifold can be topologically flat embedded into it. There is a single connected closed…

The problem of deciding, given a complex variety X, a point x in X, and a subvariety Z of X, whether there is an automorphism of X mapping x into Z is proved undecidable. Along the way, we prove the undecidability of a version of Hilbert's…

We show that a space with a finite asymptotic dimension is embeddable in a non-positively curved manifold. Then we prove that if a uniformly contractible manifold X is uniformly embeddable in $\R^n$ or non-positively curved n-dimensional…

Let $M$ be a connected, non-compact $m$-dimensional Riemannian manifold. In this paper we consider smooth maps $\phi: M \to \mathbb{R}^n$ with images inside a non-degenerate cone. Under quite general assumptions on $M$, we provide a lower…

It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly…

Manifold learning techniques seek to discover structure-preserving mappings of high-dimensional data into low-dimensional spaces. While the new sets of coordinates specified by these mappings can closely parameterize the data, they are…

The emptiness and containment problems for probabilistic automata are natural quantitative generalisations of the classical language emptiness and inclusion problems for Boolean automata. It is well known that both problems are undecidable.…

Optimization methods play a central role in signal processing, serving as the mathematical foundation for inference, estimation, and control. While classical iterative optimization algorithms provide interpretability and theoretical…

We prove that given two compact oriented $3$-manifolds $N$ and $M,$ with $M$ satisfying only a mild hypothesis, there is a hyperbolic $3$-manifold $N'$ arbitrarily ``closely related'' to $N,$ and such that $N'$ does not embed in $M.$ For…

We consider linear optimization over a fixed compact convex feasible region that is semi-algebraic (or, more generally, "tame"). Generically, we prove that the optimal solution is unique and lies on a unique manifold, around which the…

A basic question in submanifold theory is whether a given isometric immersion $f\colon M^n\to\R^{n+p}$ of a Riemannian manifold of dimension $n\geq 3$ into Euclidean space with low codimension $p$ admits, locally or globally, a genuine…

We show that every bordered Riemann surface, $M$, with smooth boundary $bM$ admits a proper holomorphic map $M\to \Omega$ into any bounded strongly pseudoconvex domain $\Omega$ in $\mathbb C^n$, $n>1$, extending to a smooth map $f:\overline…

In complexity theory, there exists a famous unsolved problem whether NP can be P or not. In this paper, we discuss this aspect in SAT (satisfiability) problem, and it is shown that the SAT can be solved in plynomial time by means of quantum…

Manifold learning techniques have become increasingly valuable as data continues to grow in size. By discovering a lower-dimensional representation (embedding) of the structure of a dataset, manifold learning algorithms can substantially…

We study computable PAC (CPAC) learning as introduced by Agarwal et al. (2020). First, we consider the main open question of finding characterizations of proper and improper CPAC learning. We give a characterization of a closely related…

In this paper we study the rational homotopy of the space of immersions, $Imm\left(M,N\right)$, of a manifold $M$ of dimension $m\geq 0$ into a manifold $N$ of dimension $m+k$, with $k\geq 2$. In the special case when $N=\mathbb{R}^{m+k}$…

We settle the equivalence between the problem of hitting a polyhedral set by the orbit of a linear map and the intersection of a regular language and a language of permutations of binary words (the permutation filter realizability problem).…

We introduce $(k,l)$-regular maps, which generalize two previously studied classes of maps: affinely $k$-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean…

We prove a theorem on equivariant maps implying the following two corollaries: (1) Let N and M be compact orientable n-manifolds with boundaries such that M\subset N, the inclusion M\to N induces an isomorphism in integral cohomology, both…