相关论文: The kissing problem in three dimensions

We generalize the Newtonian n-body problem to spaces of curvature k=constant, and study the motion in the 2-dimensional case. For k>0, the equations of motion encounter non-collision singularities, which occur when two bodies are antipodal.…

In general, not much is known about the arithmetic of K3 surfaces. Once the geometric Picard number, which is the rank of the Neron-Severi group over an algebraic closure of the base field, is high enough, more structure is known and more…

Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the…

Let $H$ be a $k$-uniform $D$-regular simple hypergraph on $N$ vertices. Based on an analysis of the R\"odl nibble, Alon, Kim and Spencer (1997) proved that if $k \ge 3$, then $H$ contains a matching covering all but at most…

A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

We provide a complete classification of possible configurations of mutually pairwise touching infinite cylinders in Euclidian 3D space. It turns out that there is a maximum number of such cylinders possible in 3D independently on the shape…

A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distances between two distinct points in $X$. Einhorn and Schoenberg conjectured that the vertices of the regular icosahedron is the…

A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distinct distances between two distinct points in $X$ and a subset $X$ is called a locally $k$-distance set if for any point $x$ in…

There has been recent work using Shape Theory to answer the longstanding and conceptually interesting problem of what is the probability that a triangle is obtuse. This is resolved by three kissing cap-circles of rightness being realized on…

We review the extraordinary fertility and proliferation in mathematics and physics of the concept of a surface with constant and negative Gaussian curvature. In his outstanding 1868 paper Beltrami discussed how non-Euclidean geometry is…

The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) graph whose vertices correspond to the packing elements and whose two vertices are connected by an edge if the corresponding two packing…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

It has been a challenge to make seven straight round cylinders mutually touch before our now 10-year old discovery [Phys. Rev. Lett. 93, 015505 (2004)] of configurations of seven mutually touching infinitely long round cylinders (then…

Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for…

In 1965 Erd\H{o}s conjectured that the number of edges in k-uniform hypergraphs on n vertices in which the largest matching has s edges is maximized for hypergraphs of one of two special types. We settled this conjecture in the affirmative…

The three-body problem in one-dimension with a repulsive inverse square potential between every pair was solved by Calogero. Here, the known results of supersymmetric quantum mechanics are used to propose a number of new three-body…

Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing and analyzing distance distributions we provide new proof of…

The Hadwiger--Nelson problem is about determining the chromatic number of the plane (CNP), defined as the minimum number of colours needed to colour the plane so that no two points of distance 1 have the same colour. In this paper we…

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the…