Related papers: Algorithmic aspects of immersibility and embeddabi…

Given a smooth map $f:M\rightarrow N$ of closed oriented smooth manifolds, is there an immersion homotopic to $f$? We provide an algorithm that decides this when the codimension of the manifolds is odd.

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…

It is proved that any smooth manifold $\mathcal M$ of dimension $m$ admits a smooth polynomially convex embedding into $\mathbb C^n$ when $n\geq \lfloor 5m/4\rfloor$. Further, such embeddings are dense in the space of smooth maps from…

Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we…

We show that any compact smooth real $n$-dimensional manifold $M$ with $n\leq 11$ can be smoothly embedded into $\mathbb{C}^{n+1}$ as a polynomially convex set. In general, there is no such embedding into $\mathbb{C}^n$. This solves a…

Using recent machine learning results that present an information-theoretic perspective on underfitting and overfitting, we prove that deciding whether an encodable learning algorithm will always underfit a dataset, even if given unlimited…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

This survey focuses on the computational complexity of some of the fundamental decision problems in 3-manifold theory. The article discusses the wide variety of tools that are used to tackle these problems, including normal and almost…

Motivated by manifold learning techniques, we give an explicit lower bound for how far a smoothly embedded compact submanifold in ${\mathbb R}^N$ can move in a normal direction and remain an embedding. In addition, given a penalty function…

One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…

We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into $\mathbb{R}^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an $\mathbb{S}^{3}$…

Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…

This paper explores the embedding of lattice structures $L \subseteq \mathbb{R}^n$ into smooth manifolds $M \subseteq \mathbb{R}^n$ through a rigorous mathematical framework. Building upon the foundational results established in "Embedding…

We show that if $M$ is an orientable 4-dimensional infrasolvmanifold and either $\beta=\beta_1(M;\mathbb{Q})\geq2$ or $M$ is a $\mathbb{S}ol_0^4$- or a $\mathbb{S}ol_{m,n}^4$-manifold (with $m\not=n$) then $M$ is parallelizable. There are…

Suppose a finite group $G$ acts on a manifold $M$. By a theorem of Mostow, also Palais, there is a $G$-equivariant embedding of $M$ into the $m$-dimensional Euclidean space $\RR^{m}$ for some $m$. We are interested in some explicit bounds…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

Normal surface theory, a tool to represent surfaces in a triangulated 3-manifold combinatorially, is ubiquitous in computational 3-manifold theory. In this paper, we investigate a relaxed notion of normal surfaces where we remove the…