Related papers: Sphere recognition lies in NP

This paper discusses improvements to the numerical robustness of the algorithm described in Kasper Fauerby's "Improved Collision Detection and Response." The algorithm addresses a common collision detection query: a moving sphere or…

We prove that for any knot $K$, there exists a one-vertex triangulation of the $3$-sphere containing an edge forming $K$. The proof is constructive, and based on fully augmented links. We use our method to produce ``complicated'' simplicial…

We consider spectral minimal partitions. Continuing work of the the present authors about problems for planar domains, [23], we focus on the sphere and obtain a sharp result for 3-partitions which is related to questions from harmonic…

We give a simple proof of a recent result by Kleinbock and Merrill concerning intrinsic approximations on sphere, in the simplest case of two-dimensional sphere in $\mathbb{R}^3$.

In this short note, we prove that on the three-sphere with any bumpy metric there exist at least four solutions of the Allen-Cahn equation with spherical interface and index at most two. The proof combines several recent results from the…

We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP$\cap$coNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite…

A triangulation of a $3$-manifold can be shown to be homeomorphic to the $3$-sphere by describing a discrete Morse function on it with only two critical faces, that is, a sequence of elementary collapses from the triangulation with one…

This is a preliminary theoretical discussion on the computational requirements of the state of the art smoothed particle hydrodynamics (SPH) from the optics of pattern recognition and artificial intelligence. It is pointed out in the…

The paper studies the problem of prescribing positive cross curvature on the three-dimensional sphere. We produce several existence results and an example of non-uniqueness, disproving a conjecture of Hamilton's.

In this paper, we prove the global rigidity of sphere packings on 3-dimensional manifolds. This is a 3-dimensional analogue of the rigidity theorem of Andreev-Thurston and was conjectured by Cooper and Rivin. We also prove a global rigidity…

Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…

While object semantic understanding is essential for most service robotic tasks, 3D object classification is still an open problem. Learning from artificial 3D models alleviates the cost of annotation necessary to approach this problem, but…

The paper describes and classifies hexagonal circular 3-webs on unit sphere such that the polar points of the web circles lie on a twisted cubic, thus completing classification of hexagonal circular 3-webs with algebraic polar curves of…

Bootstrap percolation is a class of cellular automata with random initial state. Two-dimensional bootstrap percolation models have three rough universality classes, the most studied being the `critical' one. For this class the scaling of…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

We consider a recently proposed generalisation of the abelian hidden subgroup problem: the shifted subset problem. The problem is to determine a subset S of some abelian group, given access to quantum states of the form |S+x>, for some…

In 2016 Levine showed that there exists a knot in a homology 3-sphere which is not smoothly concordant to any knot in the 3-sphere where one allows concordances in any smooth homology cobordism. Whether the same is true if one allows…

We show that the problem of determining the feasibility of quadratic systems over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$ requires exponential time. This separates P and NP over these fields/rings in the BCSS model of computation.

In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known…

Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…