相关论文: Sphere recognition lies in NP

Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data. However, obtaining an (ideally concise) explanation via hypersphere…

Interpretability of Deep Neural Networks has become a major area of exploration. Although these networks have achieved state of the art accuracy in many tasks, it is extremely difficult to interpret and explain their decisions. In this work…

Let Y be a surface with only finitely many singularities all of which are cusps. A set of cusps on Y is called three-divisible, if there is a cyclic global triple cover of Y branched precisely over these cusps. The aim of this note is to…

We complete the first step in a two-part program proposed by Baker, Grigsby, and the author to prove that Berge's construction of knots in the three-sphere which admit lens space surgeries is complete. The first step, which we prove here,…

In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…

It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…

This article reveals the future prospects of quantum algorithms in high energy physics (HEP). Particle identification, knowing their properties and characteristics is a challenging problem in experimental HEP. The key technique to solve…

The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if completed, will jointly comprise a proof of the conjecture. We carry out step five of the program [outlined in math.MG/9811073], a proof…

Working in univalent foundations, we investigate the symmetries of spheres, i.e., the types of the form $\mathbb{S}^n = \mathbb{S}^n$. The case of the circle has a slick answer: the symmetries of the circle form two copies of the circle.…

In this paper we show that for m>n the set of cobordism classes of maps from m-sphere to n-sphere is trivial. The determination of the cobordism homotopy groups of spheres admits applications to the covers for spheres.

In 2007, Arkin et al. initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They…

We construct examples of non-smoothable surfaces in the $4$-sphere, thereby answering Question 4.32 on the K3 problem list. These surfaces are non-orientable and have knot group of order $2$, thus simultaneously answering Question 4.29(a)…

An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper carries out the second step of that program. A sphere packing leads to a decomposition of $R^3$ into polyhedra. The polyhedra are divided…

We determine all CR maps from the sphere in $\mathbb{C}^3$ into the tube over the future light cone in $\mathbb{C}^4$. This result leads to a complete characterization of proper holomorphic maps from the three-dimensional unit ball into the…

Thomson problem is a classical problem in physics to study how $n$ number of charged particles distribute themselves on the surface of a sphere of $k$ dimensions. When $k=2$, i.e. a 2-sphere (a circle), the particles appear at equally…

The classical Poincar{\'e} conjecture that every homotopy 3-sphere is diffeomorphic to the 3-sphere is confirmed by Perelman in arXiv papers solving Thurston's program on geometrizations of 3-manifolds. A new confirmation of this conjecture…

The relationship between the complexity classes $P$ and $NP$ is an unsolved question in the field of theoretical computer science. In the first part of this paper, a lattice framework is proposed to handle the 3-CNF-SAT problems, known to…

We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solution of size $k$ can be extended into a partial solution of…

For smooth embeddings of an integral homology 3-sphere in the 6-sphere, we define an integer invariant in terms of their Seifert surfaces. Our invariant gives a bijection between the set of smooth isotopy classes of such embeddings and the…

Developing deep learning techniques for geometric data is an active and fruitful research area. This paper tackles the problem of sphere-type surface learning by developing a novel surface-to-image representation. Using this representation…