Related papers: Embeddability in $\mathbb{R}^3$ is NP-hard

We determine all hyperbolic 3-manifolds $M$ admitting two toroidal Dehn fillings at distance 4 or 5. We show that if $M$ is a hyperbolic 3-manifold with a torus boundary component $T_0$, and $r,s$ are two slopes on $T_0$ with $\Delta(r,s) =…

The vanishing of Van Kampen's obstruction is known to be necessary and sufficient for embeddability of a simplicial n-complex into $R^{2n}$ for $n\neq 2$, and it was recently shown to be incomplete for $n=2$. We use algebraic-topological…

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - \epsilon$, assuming the Unique…

This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…

We describe an algorithm which has enabled us to give a complete list, without repetitions, of all closed oriented irreducible 3-manifolds of complexity up to 9. More interestingly, we have actually been able to give a "name" to each such…

We show a criterion for a skeleton of a manifold triangulation being embeddable into Euclidean space in terms of the complement of a submanifold. As an application, we obtain embeddability of a $(q-1)$-skeleton of a triangulation of an…

We show that given a 3-colorable graph, it is NP-hard to find a 3-coloring with $(16/17 + \eps)$ of the edges bichromatic. In a related result, we show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to…

The 3SUM problem represents a class of problems conjectured to require $\Omega (n^2)$ time to solve, where $n$ is the size of the input. Given two polygons $P$ and $Q$ in the plane, we show that some variants of the decision problem,…

Efficient embedding virtual clusters in physical network is a challenging problem. In this paper we consider a scenario where physical network has a structure of a balanced tree. This assumption is justified by many real- world…

The notion of a complex tangent arises for embeddings of real manifolds into complex spaces. It is of particular interest when studying embeddings of real $n$-dimensional manifolds into $\mathbb{C}^n$. The generic topological structure of…

We study conditions under which a finite simplicial complex $K$ can be mapped to $\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\to \mathbb R^d$ such that the images of any $r$ pairwise…

We consider a priori estimates of Weyl's embedding problem of $(\mathbb{S}^2, g)$ in general $3$-dimensional Riemannian manifold $(N^3, \bar g)$. We establish interior $C^2$ estimate under natural geometric assumption. Together with a…

We consider two natural problems arising in geometry which are equivalent to the local solvability of specific equations of Monge-Ampere type. These two problems are: the local isometric embedding problem for two-dimensional Riemannian…

We provide two new proofs of a theorem of Cooper, Long and Reid which asserts that, apart from an explicit finite list of exceptional manifolds, any compact orientable irreducible 3-manifold with non-empty boundary has large fundamental…

An irreducible 3--manifold with torus boundary either is a Seifert fibered space or admits at most three lens space fillings according to the Cyclic Surgery Theorem. We examine the sharpness of this theorem by classifying the non-hyperbolic…

Let $\mathcal{Z}$ be a spin $4$-manifold carrying a parallel spinor and $M\hookrightarrow \mathcal{Z}$ a hypersurface. The second fundamental form of the embedding induces a flat metric connection on $TM$. Such flat connections satisfy a…

In algebraic geometry, trigonal curves can always be embedded into Hirzebruch surfaces. In tropical geometry, the notion of trigonality does not have a unique translation. We focus on the characterization in terms of the existence of a…

In this article, we study the complexity of the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem is NP-hard on general networks. However, in some particular cases, we prove…

We prove a version of Whitney's strong embedding theorem for isometric embeddings within the general setting of the Nash-Kuiper h-principle. More precisely, we show that any $n$-dimensional smooth compact manifold admits infinitely many…

In the discrete Tempotron learning problem a neuron receives time varying inputs and for a set of such input sequences ($\mathcal S_-$ set) the neuron must be sub-threshold for all times while for some other sequences ($\mathcal S_+$ set)…