相关论文: New upper bounds on sphere packings II
Patterns in triangulated $2$-spheres and $3$-spheres are investigated. A new proof of a lemma in Abigail Thompson's proof of the Recognition Algorithm for $3$-spheres is obtained.
In an earlier paper the author defined N1L configurations, and stated a conjecture concerning them which would lead to an improvement by a constant factor to the sphere-packing bound for linear double error correcting codes. Here a computer…
We establish upper and lower universal bounds for potentials of weighted designs on the sphere $\mathbb{S}^{n-1}$ that depend only on quadrature nodes and weights derived from the design structure. Our bounds hold for a large class of…
This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
We provide the first known upper bounds for the packing dimension of weighted singular and weighted $\omega$-singular matrices. We also prove upper bounds for these sets when intersected with fractal subsets. The latter results, even in the…
In this paper, we solve completely the $L^2\to L^r$ extension conjecture for the zero radius sphere over finite fields. We also obtain the sharp $L^p\to L^4$ extension estimate for non-zero radii spheres over finite fields, which improves…
We generalize to $n$-torsion a result of Kempf's describing $2$-torsion points lying on a theta divisor. This is accomplished by means of certain semihomogeneous vector bundles introduced and studied by Mukai and Oprea. As an application,…
Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…
We consider the ensemble of curves $\{\gamma_{\alpha,N}:\alpha\in(0,1],N\in\N\}$ obtained by linearly interpolating the values of the normalized theta sum $N^{-1/2}\sum_{n=0}^{N'-1}\exp(\pi i n^2\alpha)$, $0\leq N'<N$. We prove the…
We prove new Pitt inequalities for the Fourier transforms with radial and non-radial weights using weighted restriction inequalities for the Fourier transform on the sphere. We also prove new Riemann-Lebesgue estimates and versions of the…
A judicious application of the Berry-Esseen theorem via suitable Augustin information measures is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is…
This paper describes the local density inequality approach to getting upper bounds for sphere packing densities in R^n. This approach was first suggested by L. Fejes-Toth in 1956 to prove the Kepler conjecture that the densest sphere…
This article sketches the proofs of two theorems about sphere packings in Euclidean 3-space. The first is K. Bezdek's strong dodecahedral conjecture: the surface area of every bounded Voronoi cell in a packing of balls of radius 1 is at…
In the first paper of this series we established new upper bounds for multi-variable exponential sums associated with a quadratic form. The present study shows that if one adds a linear term in the exponent, the estimates can be further…
We derive lower bounds on the maximal rates for multiple packings in high-dimensional Euclidean spaces. Multiple packing is a natural generalization of the sphere packing problem. For any $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $, a multiple…
In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to show, interpreting the following notions appropriately, that if…
In this article we investigate the $N$-point min-max and the max-min polarization problems on the sphere for a large class of potentials in $\mathbb{R}^n$. We derive universal lower and upper bounds on the polarization of spherical designs…
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…