Related papers: Kissing number in hyperbolic space
We prove that the kissing number in 19 dimensions is at least 11948, improving the bound of Cohn and Li by 256. By the odd-sign construction of Cohn and Li, it is enough to find a binary code of length 19 and minimum distance 5 inside the…
We investigate asymptotic behavior of polynomials $p^{\omega}_n(z)$ satisfying varying non-Hermitian orthogonality relations $$ \int_{-1}^{1} x^kp^{\omega}_n(x)h(x) e^{\mathrm{i} \omega x}\mathrm{d} x =0, \quad k\in\{0,\ldots,n-1\}, $$…
A dominating set on an $n $-dimensional hypercube is equivalent to a binary covering code of length $n $ and covering radius 1. It is still an open problem to determine the domination number $\gamma(Q_n)$ for $ n\geq10$ and $…
We consider how flat a lattice simplex contained in the hypercube $[0,k]^d$ can be. This question is related to the notion of kissing polytopes: two lattice polytopes contained in the hypercube $[0,k]^d$ are kissing when they are disjoint…
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…
We construct a sequence of lattices $\{L_{n_i}\subset \mathbb R^{n_i}\}$ for $n_i\longrightarrow\infty$, with exponentially large kissing numbers, namely, $\log_2\tau(L_{n_i})> 0.0338\cdot n_i -o(n_i)$. We also show that the maximum lattice…
The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a…
In this short note, we establish an upper bound for the conjugate radius of an open $n$-dimensional Riemannian manifold under a scalar curvature lower bound and a bottom-of-spectrum upper bound. As a consequence, if $\lambda_{0}(M)=0$ and…
The Dehn function of a metric space measures the area necessary in order to fill a closed curve of controlled length by a disc. As a main result, we prove that a length space has curvature bounded above by $\kappa$ in the sense of…
In discrete geometry, the contact number of a given finite number of non-overlapping spheres was introduced as a generalization of Newton's kissing number. This notion has not only led to interesting mathematics, but has also found…
For a conformally compact manifold that is hyperbolic near infinity and of dimension $n+1$, we complete the proof of the optimal $O(r^{n+1})$ upper bound on the resonance counting function, correcting a mistake in the existing literature.…
In 1694, Gregory and Newton proposed the problem to determine the kissing number of a rigid material ball. This problem and its higher dimensional generalization have been studied by many mathematicians, including Minkowski, van der…
Given a lattice $\Lambda \subset \mathbb{R}^n$, we consider its Minkowski reduced basis and the solid angle $\Omega$ spanned by the basis vectors. Such a basis satisfies strong near-orthogonality conditions, which allow us to bound from…
We show that if a $CD(K,n)$ space $(X,d,f\mathcal{H}^n)$ with $n\geq 2$ has curvature bounded from above by $\kappa$ in the sense of Alexandrov then $f=const$.
Contact numbers are natural extensions of kissing numbers. In this paper we give estimates for the number of contacts in a totally separable packing of n unit balls in Euclidean d-space for all n>1 and d>1.
We prove that in a metric measure space $X$, if for some $p \in (1,\infty)$ there are uniform bounds (independent of the measure) for the weak type $(p,p)$ of the centered maximal operator, then $X$ satisfies a certain geometric condition,…
We derive bounds for the ball $L_p$-discrepancies in the Hamming space for $0<p<\infty$ and $p=\infty$. Sharp estimates of discrepancies have been obtained for many spaces such as the Euclidean spheres and more general compact Riemannian…
Addressing questions raised in recent papers, we study the $r$-distance graph $H_r(n)$ on the Boolean cube $\{0,1\}^n$, where two vertices are adjacent if their Hamming distance is exactly $r$. For fixed integers $s \ge 2$ and even $r \ge…
We show that if a noncollapsed $CD(K,n)$ space $X$ with $n\ge 2$ has curvature bounded above by $\kappa$ in the sense of Alexandrov then $K\le (n-1)\kappa$ and $X$ is an Alexandrov space of curvature bounded below by $K-\kappa (n-2)$. We…
These lecture notes treat the solution of the kissing number problem in four dimesions which is based on an extension of the Delsarte method for spherical codes.