Related papers: Linear programming bounds in homogeneous spaces, I…
The Cohn-Elkies linear programming (LP) bound for sphere packing is known to be sharp in dimensions 8 and 24 but in no other dimension above 2. We investigate why by examining three independent necessary conditions for LP sharpness, drawn…
We prove that, up to isometric congruence, there are exactly 2n+1 homogeneous polar foliations of the complex hyperbolic space. We also give an explicit description of each of these foliations.
We prove a lower bound on the entropy of sphere packings of $\mathbb R^d$ of density $\Theta(d \cdot 2^{-d})$. The entropy measures how plentiful such packings are, and our result is significantly stronger than the trivial lower bound that…
A framework is developed for applying accelerated methods to general hyperbolic programming, including linear, second-order cone, and semidefinite programming as special cases. The approach replaces a hyperbolic program with a convex…
Let L be a holomorphic line bundle over a compact complex projective Hermitian manifold X. Any fixed smooth hermitian metric h on L induces a Hilbert space structure on the space of global holomorphic sections with values in the k th tensor…
This work is concerned with the formulation of a general framework for the analysis of meshfree approximation schemes and with the convergence analysis of the Local Maximum-Entropy (LME) scheme as a particular example. We provide conditions…
In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…
Let K be a complete ultrametric field. We give lower and upper bounds for the size of linearization discs for power series over K near hyperbolic fixed points. These estimates are maximal in the sense that there exist examples where these…
We establish the optimal nonergodic sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems. First, the optimal bound is formulated by the performance estimation framework, resulting in an infinite…
In this article we present a unified treatment for obtaining bounds on the potential energy of codes in the general context of polynomial metric spaces (PM-spaces). The lower bounds we derive via the linear programming (LP) techniques of…
We prove upper bounds on the average kissing number $k(\mathcal{P})$ and contact number $C(\mathcal{P})$ of an arbitrary finite non-congruent sphere packing $\mathcal{P}$, and prove an upper bound on the packing density…
The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the…
We obtain strong upper bounds for the Betti numbers of compact complex-hyperbolic manifolds. We use the unitary holonomy to improve the results given by the most direct application of the techniques of [DS17]. We also provide effective…
We study translative arrangements of centrally symmetric convex domains in the plane (resp., of congruent balls in the Euclidean $3$-space) that neither pack nor cover. We define their soft density depending on a soft parameter and prove…
The function on the Teichmueller space of complete, orientable, finite-area hyperbolic surfaces of a fixed topological type that assigns to a hyperbolic surface its maximal injectivity radius has no local maxima that are not global maxima.
We perform a detailed analysis of the solvability of linear strain equations on hyperbolic surfaces to obtain $L^2$ regularity solutions. Then the rigidity results on the strain tensor of the middle surface are implied by the $L^2$…
We present an extension of known semidefinite and linear programming upper bounds for spherical codes. We apply the main result for the distance distribution of a spherical code and show that this method can work effectively In particular,…
We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the pre-factor can be significantly improved from the order of…
Our main result is that for all sufficiently large $x_0>0$, the set of commensurability classes of arithmetic hyperbolic 2- or 3-orbifolds with fixed invariant trace field $k$ and systole bounded below by $x_0$ has density one within the…
We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…