相关论文: Sphere recognition lies in NP

We solve the equivalence problem for the orthogonally separable webs on the three-sphere under the action of the isometry group. This continues a classical project initiated by Olevsky in which he solved the corresponding canonical forms…

We prove new results on existence of solutions for the prescribed gaussian curvature problem on the euclidean sphere S^2. Those results are achieved by relating this problem with the holomorphic triples theory on Riemann surfaces. We think…

Within crystallization theory, (Matveev's) complexity of a 3-manifold can be estimated by means of the combinatorial notion of GM-complexity. In this paper, we prove that the GM-complexity of any lens space L(p,q), with p greater than 2, is…

Three dimensional (3D) object recognition is becoming a key desired capability for many computer vision systems such as autonomous vehicles, service robots and surveillance drones to operate more effectively in unstructured environments.…

We consider an embedding of a $2$-dimensional CW complex into the $3$-sphere, and construct it's dual graph. Then we obtain a homogeneous system of linear equations from the $2$-dimensional CW complex in the first homology group of the…

This is a survey paper on algorithms for solving problems in 3-dimensional topology. In particular, it discusses Haken's approach to the recognition of the unknot, and recent variations.

A classification theorem is given of smooth threefolds of $\Bbb P^5$ covered by a family of dimension at least three of plane integral curves of degree $d\geq 2.$ It is shown that for such a threefold $X$ there are two possibilities:…

The Orbit Problem asks whether the orbit of a point under a matrix reaches a given target set. When the target is a single point, the problem was shown to be decidable in polynomial time by Kannan and Lipton. This decidability result was…

The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. In this work, we propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in…

Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…

We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem---determining whether a target vector space V may be reached from a starting point x under repeated applications of a linear transformation A. Answering two…

In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An algorithm for solving any problem is sensitive to even small…

Adyan and Rabin showed that most properties of groups cannot be algorithmically recognized from a finite presentation alone. We prove that, if one is also given a solution to the word problem, then the class of fundamental groups of closed,…

Proof of existence of a complex structure on the six-sphere, followed by an explicit computation of its underlying integrable almost complex tensor by the aid of inner automorphisms of the octonions, is exhibited. Both are elementary and…

We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…

We show that the directed topological complexity (as defined by E. Goubault) of the directed $n$-sphere is $2$, for all $n\ge1$.

We have employed Particle Swarm Optimization to address a stochastic variant of the Smallest Enclosing Sphere estimation problem. An efficient algorithm has been developed to ascertain the optimal center and radius of a sphere encompassing…

We develop new elements of harmonic analysis on the complex sphere on the basis of which Bernstein's, Jackson's and Kolmogorov's inequalities are established. We apply these results to get order sharp estimates of $m$-term approximations.…

We introduce bridge trisections of knotted surfaces in the four-sphere. This description is inspired by the work of Gay and Kirby on trisections of four-manifolds and extends the classical concept of bridge splittings of links in the…

Given a Bridgeland stability condition on a 2-Calabi--Yau category, we define a simplicial complex that encodes the Harder--Narasimhan filtrations of spherical objects. For 2-Calabi--Yau categories of type A, we relate this complex to the…