English
Related papers

Related papers: Sphere recognition lies in NP

200 papers

This is the sixth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

The thirteen spheres problem is asking if 13 equal size nonoverlapping spheres in three dimensions can touch another sphere of the same size. This problem was the subject of the famous discussion between Isaac Newton and David Gregory in…

Metric Geometry · Mathematics 2015-03-13 Oleg Musin , Alexey Tarasov

Third order equations, which describe spherical surfaces (ss) or pseudospherical surfaces (pss), of the form \[ \nu\,z_{t}-\lambda\,z_{xxt}=A(z,z_{x},z_{xx})\,z_{xxx}+B(z,z_{x},z_{xx}) \] with $\nu$, $\lambda$ $\in$ $\mathbb{R}$,…

Differential Geometry · Mathematics 2023-03-27 Diego Catalano Ferraioli , Tarcísio Castro Silva

The complexity class DP is the class of all languages that are the intersection of a language in NP and a language in coNP. It was conjectured that recognizing a facet for the knapsack polytope is DP-complete. We provide a positive answer…

Optimization and Control · Mathematics 2025-10-21 Rui Chen , Haoran Zhu

In density functional theory, charge density is the core attribute of atomic systems from which all chemical properties can be derived. Machine learning methods are promising in significantly accelerating charge density prediction, yet…

Computational Physics · Physics 2024-05-30 Xiang Fu , Andrew Rosen , Kyle Bystrom , Rui Wang , Albert Musaelian , Boris Kozinsky , Tess Smidt , Tommi Jaakkola

In this article we describe a new convolutional neural network (CNN) to classify 3D point clouds of urban or indoor scenes. Solutions are given to the problems encountered working on scene point clouds, and a network is described that…

Computer Vision and Pattern Recognition · Computer Science 2018-04-11 Xavier Roynard , Jean-Emmanuel Deschaud , François Goulette

Thurston's sphere packing on a 3-dimensional manifold is a generalization of Thusrton's circle packing on a surface, the rigidity of which has been open for many years. In this paper, we prove that Thurston's Euclidean sphere packing is…

Geometric Topology · Mathematics 2023-05-10 Xiaokai He , Xu Xu

We apply mapping class group techniques and trisections to study intersection forms of smooth 4-manifolds. Johnson defined a well-known homomorphism from the Torelli group of a compact surface. Morita later showed that every homology…

Geometric Topology · Mathematics 2020-04-29 Peter Lambert-Cole

Modeling deformations of a real object is an important task in computer vision, biomedical engineering and biomechanics. In this paper, we focus on a situation where a three-dimensional object is rotationally deformed about a fixed axis,…

Statistics Theory · Mathematics 2016-06-14 Sungkyu Jung

Let $\Gamma$ be a subgroup of $PSL(2,R)$ generated by three parabolic transformations. The main goal of this paper is to present an algorithm to determine whether or not $\Gamma$ is discrete. Historically discreteness algorithms have been…

Geometric Topology · Mathematics 2020-12-02 Caleb Ashley

In this paper, we prove some differentiable sphere theorems and topological sphere theorems for submanifolds in K\"ahler manifold, especially in complex space forms.

Differential Geometry · Mathematics 2018-10-18 Jun Sun , Linlin Sun

The influence of atmospheric turbulence on acquired surveillance imagery poses significant challenges in image interpretation and scene analysis. Conventional approaches for target classification and tracking are less effective under such…

Computer Vision and Pattern Recognition · Computer Science 2023-05-31 Disen Hu , Nantheera Anantrasirichai

In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…

Geometric Topology · Mathematics 2019-09-18 Greg Kuperberg

We investigate the complexity of finding an embedded non-orientable surface of Euler genus $g$ in a triangulated $3$-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance…

Geometric Topology · Mathematics 2016-09-02 Benjamin A. Burton , Arnaud de Mesmay , Uli Wagner

We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden…

Computational Complexity · Computer Science 2007-06-27 Gabor Kun , Jaroslav Nesetril

The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…

Numerical Analysis · Mathematics 2007-05-23 Wolfgang zu Castell , Noemi Lain Fernandez , Yuan Xu

Point clouds are widely used representations of 3D data, but determining the visibility of points from a given viewpoint remains a challenging problem due to their sparse nature and lack of explicit connectivity. Traditional methods, such…

Graphics · Computer Science 2025-09-30 Jun-Hao Wang , Yi-Yang Tian , Baoquan Chen , Peng-Shuai Wang

We investigate the group of points of the $3$-sphere modulo a prime, point out connections to other known groups and the Chebyshev polynomials, and show that there is an infinite series which converges if and only if there are finitely many…

Number Theory · Mathematics 2024-07-09 Samuel A. Hambleton

Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…

Computational Complexity · Computer Science 2019-11-19 Chris Jones , Matt McPartlon

We consider the homogenized linear feasibility problem, to find an $x$ on the unit sphere, satisfying $n$ line ar inequalities $a_i^Tx\ge 0$. To solve this problem we consider the centers of the insphere of spherical simpl ices, whose…

Optimization and Control · Mathematics 2007-05-23 Ulrich Betke