相关论文: Sphere recognition lies in NP

In a previous paper, we proved a number of optimal rigidity results for Riemannian manifolds of dimension greater than four whose curvature satisfy an integral pinching. In this article, we use the same integral Bochner technique to extend…

We determine all local smooth or formal CR maps from the unit sphere $\mathbb{S}^3\subset \mathbb{C}^2$ into the tube $\mathcal{T}:= \mathcal{C} \times i\mathbb{R}^3 \subset \mathbb{C}^3$ over the future light cone $\mathcal{C}:=…

We prove Arnol'd's three cusps conjecture about the front of Legendrian curves in the projectivized cotangent bundle of the $2$-sphere. We use the microlocal theory of sheaves of Kashiwara and Schapira and study the derived category of…

We show that, for any prime p, a knot K in the 3-sphere is determined by its p-fold cyclic unbranched covering. We also investigate when the m-fold cyclic unbranched covering of a knot coincides with the n-fold cyclic unbranched covering of…

A major challenge in scene graph classification is that the appearance of objects and relations can be significantly different from one image to another. Previous works have addressed this by relational reasoning over all objects in an…

Given a 3-uniform hypergraph H, its 2-intersection graph G has for vertex set the hyperedges of H and ee' is an edge of G whenever e and e' have exactly two common vertices in H. Di Marco et al. prove that deciding wether a graph G is the…

We prove a complexity dichotomy theorem for the six-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or #P-hard. The dichotomy criterion is…

For the problem of 3D object recognition, researchers using deep learning methods have developed several very different input representations, including "multi-view" snapshots taken from discrete viewpoints around an object, as well as…

We revisit the elegant observation of T. Cover '65 which, perhaps, is not as well-known to the broader community as it should be. The first goal of the tutorial is to explain---through the prism of this elementary result---how to solve…

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

Let $G$ be a strictly pseudoconvex domain in $\mathbb{C}^2$ with $C^\infty$-smooth boundary $\partial G$. Let $S$ be a 2-dimensional sphere embedded into $\partial G$. Denote by $\mathcal{E}$ the set of all complex points on $S$. We study…

We consider the problem when lens spaces are given from homology spheres, and demonstrate that many lens spaces are obtained from L-space homology sphere which the Ozsv\'ath Szab\'o's correction term $d(Y)$ is equal to 2. We show an…

For a fixed marked surface $S$, we show that the problem of deciding whether or not a mapping class is reducible lies in $\textbf{NP}$. As usual this immediately gives an exponential time algorithm to decide whether or not a mapping class…

Using degree N isogenies of elliptic curves, we produce a spectrum Q(N). This spectrum is built out of spectra related to tmf. At p=3 we show that the K(2)-local sphere is built out of Q(2) and its K(2)-local Spanier-Whitehead dual. This…

We analyze the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in $\Bbb C^n$. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDdegree) of a…

The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…

In this paper, we give a full classification of the separable hypersurfaces of constant sectional curvature in the Euclidean $n$-space $\mathbb{R}^n$. In dimension $n=3$, this classification was solved by Hasanis and L\'opez [Manuscripta…

The problem of when a given digraph contains a subdivision of a fixed digraph $F$ is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algorithmic point of view. In this paper we give further support…

This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…

Any four mutually tangent spheres in R^3 determine three coincident lines through opposite pairs of tangencies. As a consequence, we define two new triangle centers.