相关论文: The kissing problem in three dimensions
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…
Let $X$ be a finite set in a complex sphere of $d$ dimension. Let $D(X)$ be the set of usual inner products of two distinct vectors in $X$. A set $X$ is called a complex spherical $s$-code if the cardinality of $D(X)$ is $s$ and $D(X)$…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/k\rfloor-1$. We show that if $H$ is a $k$-uniform hypergraph…
In 1933, K. Borsuk proposed the following problem: Can every bounded set in $\mathbb{E}^n$ be divided into $n+1$ subsets of smaller diameters? In 1965, V. G. Boltyanski and I. T. Gohberg made the following conjecture: Every bounded set in…
In the first paper of this series, we constructed a family of lattices in dimensions 2^{n+1} for positive integers n, and proved that the associated lattice packings of spheres equal or exceed the previous records for several values of n.…
In 1995, Josckusch constructed an infinite family of centrally symmetric (cs, for short) triangulations of $3$-spheres that are cs-$2$-neighborly. Recently, Novik and Zheng extended Jockusch's construction: for all $d$ and $n>d$, they…
We derive several results in classical Euclidean elementary geometry using the steering ellipsoid formalism from quantum mechanics. This gives a physically motivated derivation of very non-trivial geometric results, some of which are…
In this article we further develop methods for representing integers as a sum of three cubes. In particular, a barrier to solving the case $k=3$, which was outlined in a previous paper of the second author, is overcome. A very recent…
We solve a problem of Littlewood: there exist seven infinite circular cylinders of unit radius which mutually touch each other. In fact, we exhibit two such sets of cylinders. Our approach is algebraic and uses symbolic and numerical…
The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal…
This article studies the number of ways of selecting $k$ objects arranged in $p$ circles of sizes $n_1,\ldots,n_p$ such that no two selected ones have less than $s$ objects between them. If $n_i\geq sk+1$ for all $1\leq i \leq p$, this…
The $k$-ExactCover problem is a parameterized version of the ExactCover problem, in which we are given a universe $U$, a collection $S$ of subsets of $U$, and an integer $k$, and the task is to determine whether $U$ can be partitioned into…
The famous three-body problem can be traced back to Isaac Newton in 1680s. In the 300 years since this "three-body problem" was first recognized, only three families of periodic solutions had been found, until 2013 when \v{S}uvakov and…
Given R\subset N, an (R,k)$-sphere is a k-regular map on the sphere whose faces have gonalities i\in R. The most interesting/useful are (geometric) fullerenes, i.e., (\{5,6\},3)$-spheres. Call \kappa_i=1 + \frac{i}{k} - \frac{i}{2} the…
We show that, for any positive real number, there exists a knot in the 3-sphere admitting a pair of boundary slopes whose difference is at most the given number.
Spherical t-designs are Chebyshev-type averaging sets on the d-sphere S^d which are exact for polynomials of degree at most t. This concept was introduced in 1977 by Delsarte, Goethals, and Seidel, who also found the minimum possible size…
In this paper, an approach is developed to solve the three body problem involving masses which posses spherical symmetry. The problem dates back to the times of Poincare, and is undoubtedly one of the oldest of unsolved problems of…
The isoperimetric problem is one of the oldest in geometry and it consists of finding a surface of minimum area that encloses a given volume $V$. It is particularly important in physics because of its strong relation with stability, and…
We propose 3D generalizations of the Feuerbach theorem: the first one deals with a tetrahedron analogue of the Euler circle, the second one is done by means of an {\guillemotleft}up-in-ex-touch{\guillemotright} construction. Then we give a…