Related papers: Algorithmic aspects of immersibility and embeddabi…
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…
If a continuous map f: X->Q is approximable arbitrary closely by embeddings X->Q, can some embedding be taken onto f by a pseudo-isotopy? This question, called Isotopic Realization Problem, was raised by Shchepin and Akhmet'ev. We consider…
Inspired by the analogous result in the algebraic setting (Theorem 1) we show (Theorem 2) that the product $M \times \mathbb{R}P^n$ of a closed and orientable topological manifold $M$ with the $n$-dimensional real projective space cannot be…
We classify immersions $f$ of $S^1$ in a $2$-manifold $M$ in terms of elementary invariants: the parity $S(f)$ of the number of double points of a self-transverse $C^1$-approximation of $f$, and the turning number $T(e\bar f)$ of the…
Consider a domain D in R^3 which is convex (possibly all R^3) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f : M --> D. Moreover, if D is smooth and bounded, then…
Quantum bits can be isolated to perform useful information-theoretic tasks, even though physical systems are fundamentally described by very high-dimensional operator algebras. This is because qubits can be consistently embedded into…
This paper is concerned with "nice" compactifications of manifolds. Siebenmann's iconic dissertation characterized open manifolds M^m (m>5) compactifiable by addition of a manifold boundary. His theorem extends easily to cases where M^m is…
Every 4-dimensional infrasolvmanifold $M$ with $\beta_1(M;\mathbb{Q})>0$ or which is flat or has one of the geometries $\mathbb{N}il^4$, $\mathbb{S}ol_{m,n}^4$, or $\mathbb{S}ol_0^4$ bounds. However there are non-orientable…
In this paper we find necessary and sufficient conditions for a nondegenerate arbitrary signature manifold $M^n$ to be realized as a submanifold in the large class of warped product manifolds $\varepsilon…
This is a survey of results on definability and undefinability in models of arithmetic. The goal is to present a stark difference between undefinability results in the standard model and much stronger versions about expansions of…
The unwavering success of deep learning in the past decade led to the increasing prevalence of deep learning methods in various application fields. However, the downsides of deep learning, most prominently its lack of trustworthiness, may…
The Monniaux Problem in abstract interpretation asks, roughly speaking, whether the following question is decidable: given a program $P$, a safety (\emph{e.g.}, non-reachability) specification $\varphi$, and an abstract domain of invariants…
Let M and N be smooth manifolds. For an open V of M let emb(V,N) be the space of embeddings from V to N. By results of Goodwillie and Goodwillie-Klein, the cofunctor V |--> emb(V,N) is analytic if dim(N)-dim(M) > 2. We deduce that its…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
Given a sequence of properly embedded minimal surfaces in a $3$-manifold with local bounds on area and genus, we prove subsequential convergence, smooth away from a discrete set, to a smooth embedded limit surface, possibly with…
The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable…
The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was not excluded that such a problem were undecidable, due to…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
Consider a multi-class labelling problem, where the labels can take values in $[k]$, and a predictor predicts a distribution over the labels. In this work, we study the following foundational question: Are there notions of multi-class…