Related papers: Sphere recognition lies in NP

We describe an algorithm to decide whether two genus-two surfaces embedded in the 3-sphere are isotopic or not. The algorithm employs well-known techniques in 3-manifolds topology, as well as a new algorithmic solution to a problem on free…

We completely classify edge-to-edge tilings of the sphere by congruent quadrilaterals. As part of the classification, we also present a modern version of the classification of edge-to-edge tilings of the sphere by congruent triangles.…

A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…

In this paper, a deep learning (DL)-based sphere decoding algorithm is proposed, where the radius of the decoding hypersphere is learned by a deep neural network (DNN). The performance achieved by the proposed algorithm is very close to the…

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P or is NP-complete (Feder-Vardi, 1993). It has been verified for conservative problems (also known as list homomorphism problems) by A.…

In this paper we describe a procedure to simplify any given triangulation of the 3-sphere using Pachner moves. We obtain an explicit exponential-type bound on the number of Pachner moves needed for this process. This leads to a new…

In this paper, we will study the following pattern recognition problem: Every pattern is a 3-dimensional graph, its surface can be split up into some regions, every region is composed of the pixels with the approximately same colour value…

Kirby and Lickorish showed that every knot in the 3-sphere is concordant to a prime knot, equivalently, every concordance class contains a prime knot. We prove here that their result can be strengthened: Every knot in the 3-sphere is…

We give a local analytic characterization that a minimal surface in the 3-sphere $\, \ES^3 \subset \R^4$ defined by an irreducible cubic polynomial is one of the Lawson's minimal tori. This provides an alternative proof of the result by…

The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed $\lambda$-calculus, i.e. to solve the equation a = b where a and b are simply typed $\lambda$-terms and b is…

Let $\mathcal{P}$ and $\mathcal{P}'$ be $3$-dimensional convex polytopes in $\mathbb{R}^3$ and $S \subseteq \mathbb{R}^3$ be a non-empty intersection of an open set with a sphere. As a consequence of a somewhat more general result it is…

For $N \geq 4$ we classify the $(N-3)$-degenerate smooth CR maps of the three-dimensional unit sphere into the $(2N-1)$-dimensional unit sphere. Each of these maps has image being contained in a five-dimensional complex-linear space and is…

In many practical applications, 3D point cloud analysis requires rotation invariance. In this paper, we present a learnable descriptor invariant under 3D rotations and reflections, i.e., the O(3) actions, utilizing the recently introduced…

We define an invariant of triple-point-free immersions of $2$-spheres into Euclidean $3$-space, taking values in $l^1(\mathbb{Z})$. It remains unchanged under regular homotopies through such immersions. An explicit description of its image…

There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…

As is well-known, numerical experiments show that Napoleon's Theorem for planar triangles does not extend to a similar statement for triangles on the unit sphere $S^2$. Spherical triangles for which an extension of Napoleon's Theorem holds…

We prove a new classification result for (CR) rational maps from the unit sphere in some ${\mathbb C}^n$ to the unit sphere in ${\mathbb C}^N$. To so so, we work at the level of Hermitian forms, and we introduce ancestors and descendants.

In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…