相关论文: Sphere recognition lies in NP

We show that the problem of determining whether a knot in the 3-sphere is non-trivial lies in NP. This is a consequence of the following more general result. The problem of determining whether the Thurston norm of a second homology class in…

Patterns in triangulated $2$-spheres and $3$-spheres are investigated. A new proof of a lemma in Abigail Thompson's proof of the Recognition Algorithm for $3$-spheres is obtained.

We prove the existence of a new algorithm for 3-sphere recognition based on Groebner basis methods applied to the variety of $\text{\em SL}(2,\C)$-representation of the fundamental group. An essential input is a recent result of the second…

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…

We show that the following algorithmic problem is decidable: given a $2$-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in $\mathbf{R}^3$? By a known reduction, it suffices to decide…

Sphere recognition is known to be undecidable in dimensions five and beyond, and no polynomial time method is known in dimensions three and four. Here we report on positive and negative computational results with the goal to explore the…

We prove that the fundamental group of any integer homology 3-sphere different from the 3-sphere admits irreducible representations of its fundamental group in SL(2,C). For hyperbolic integer homology spheres this comes with the definition,…

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}$…

We show that three natural decision problems about links and 3-manifolds are computationally hard, assuming some conjectures in complexity theory. The first problem is determining whether a link in the 3-sphere bounds a Seifert surface with…

We show that the problem of deciding whether a knot in a fixed closed orientable 3-dimensional manifold bounds a surface of genus at most $g$ is in co-NP. This answers a question of Agol, Hass, and Thurston in 2002. Previously, this was…

We show that the problem of showing that a cusped 3-manifold M is not hyperbolic is in NP, assuming $S^3$-RECOGNITION is in coNP. To this end, we show that IRREDUCIBLE TOROIDAL RECOGNITION lies in NP. Along the way we unconditionally…

We show that the problem of deciding whether a closed three-manifold admits an elliptic structure lies in NP. Furthermore, determining the homeomorphism type of an elliptic manifold lies in the complexity class FNP. These are both…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

We consider embeddings of a finite complex in a sphere. We give a homotopy theoretic classification of such embeddings in a wide range.

Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point…

We consider the problem of covering hypersphere by a set of spherical hypercaps. This sort of problem has numerous practical applications such as error correcting codes and reverse k-nearest neighbor problem. Using the reduction of non…

Three spheres type theorem is proved for the p-harmonic functions defined on the complement of k-balls in the Euclidean n-dimensional space.

This article gives the construction and complete classification of all three-dimensional spherical manifolds, and orders them by decreasing volume, in the context of multiconnected universe models with positive spatial curvature. It…

We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.

This is the fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…