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

We extend Matveev's theory of complexity for 3-manifolds, based on simple spines, to (closed, orientable, locally orientable) 3-orbifolds. We prove naturality and finiteness for irreducible 3-orbifolds, and, with certain restrictions and…

We convert, within polynomial-time and sequential processing, NP-Complete Problems into a problem of deciding feasibility of a given system S of linear equations with constants and coefficients of binary-variables that are 0, 1, or -1. S is…

The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra in any triangulation of the manifold. The main theorem of the paper gives upper and lower bounds on the triangulation complexity of any…

We prove that P = NP implies #P = FP by exploiting the topological structure of 3SAT solution spaces. The argument proceeds via a dichotomy: any polynomial-time algorithm for 3SAT either operates without global knowledge of the…

We consider a family $M_t^n$, with $n\ge 2$, $t>1$, of real hypersurfaces in a complex affine $n$-dimensional quadric arising in connection with the classification of homogeneous compact simply-connected real-analytic hypersurfaces in…

In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, $B_3$, have polynomial time solutions we prove that a very natural…

Any smooth projective curve embeds into $\mathbb{P}^3$. More generally, any curve embeds into a rationally connected variety of dimension at least three. We prove conversely that if every curve embeds in a threefold $X$, then $X$ is…

We develop a method for constructing standard complexes which turns easy the calculation of their algebraic invariants and, as well, the precise evaluation of whether these complexes are embeddable or not in a 3-manifold. This method…

We introduce and study the complexity of Path Packing. Given a graph $G$ and a list of paths, the task is to embed the paths edge-disjoint in $G$. This generalizes the well known Hamiltonian-Path problem. Since Hamiltonian Path is…

We discuss the possibility of extending different versions of the Campbell-Magaard theorem, which have already been established in the context of semi-Riemannian geometry, to the context of Weyl's geometry. We show that some of the known…

We define an invariant, which we call surface-complexity, of compact 3-manifolds by means of Dehn surfaces. The surface-complexity is a natural number measuring how much the manifold is complicated. We prove that it fulfils interesting…

We prove that the three-sphere recognition problem lies in the complexity class NP. Our work relies on Thompson's original proof that the problem is decidable [Math. Res. Let., 1994], Casson's version of her algorithm, and recent results of…

We introduce the notion of coupled embeddability, defined for maps on products of topological spaces. We use known results for nonsingular biskew and bilinear maps to generate simple examples and nonexamples of coupled embeddings. We study…

A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected $2$-complex every link graph of which is 3-connected…

Let $K$ be a nontrivial knot. For each $n\in \mathbb{N}$, we prove that the rank of its $n$th iterated Whitehead doubled knot group $\pi_1(S^3 \setminus \operatorname{WD}^n(K))$ is bounded below by $n+1$. As an application, we show that…

We study the complexity of identifying the integer feasibility of reverse convex sets. We present various settings where the complexity can be either NP-Hard or efficiently solvable when the dimension is fixed. Of particular interest is the…

It was recently shown that there exists an explicit bound for the number of Pachner moves needed to connect any two triangulation of any Haken 3-manifold which contains no fibred sub-manifolds as strongly simple pieces of its…

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

The purpose of this note is to scrutinize the proof of Burago and Zalgaller regarding the existence of $PL$ isometric embeddings of $PL$ compact surfaces into $\mathbb{R}^3$. We conclude that their proof does not admit a direct extension to…

We prove that a compact Riemann surface can be realized as a pseudo-holomorphic curve of $(\mathbb{R}^4,J)$, for some almost complex structure $J$ if and only if it is an elliptic curve. Furthermore we show that any (almost) complex…