Related papers: Variations on five-dimensional sphere packings
In this note we compare even and odd fuzzy sphere constructions, their dimensional reductions and possible (M)atrix actions having them as solutions. We speculate on how the fuzzy 5-sphere might appear as a solution to the pp wave (M)atrix…
The kissing number of $\mathbb{R}^n$ is the maximum number of pairwise-nonoverlapping unit spheres that can simultaneously touch a central unit sphere. Mittelmann and Vallentin (2010), based on the semidefinite programming bound of Bachoc…
The Apollonian circle packing, generated from three mutually-tangent circles in the plane, has inspired over the past half-century the study of other classes of space-filling packings, both in two and in higher dimensions. Recently,…
We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…
A generalization of highly symmetric frames is presented by considering also projective stabilizers of frame vectors. This allows construction of highly symmetric line systems and study of highly symmetric frames in a more unified manner.…
Optimal packing of spheres in $\mathbb R^d$ is studied by optimization of the energy $E$ (effective conductivity) of composites with ideally conducting spherical inclusions. It is demonstrated that the minimum of $E$ over locations of…
We prove that the kissing number in 48 dimensions among antipodal spherical codes with certain forbidden inner products is 52\,416\,000. Constructions of attaining codes as kissing configurations of minimum vectors in even unimodular…
Let the kissing number $K(d)$ be the maximum number of non-overlapping unit balls in $\mathbb R^d$ that can touch a given unit ball. Determining or estimating the number $K(d)$ has a long history, with the value of $K(3)$ being the subject…
Optical orthogonal signature pattern codes (OOSPCs) play an important role in a novel type of optical code-division multiple-access (CDMA) network for 2-dimensional image transmission. There is a one-to-one correspondence between an $(m, n,…
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 give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
Dense hard-particle packings are intimately related to the structure of low-temperature phases of matter and are useful models of heterogeneous materials and granular media. Most studies of the densest packings in three dimensions have…
New types of designs called nested space-filling designs have been proposed for conducting multiple computer experiments with different levels of accuracy. In this article, we develop several approaches to constructing such designs. The…
Finding four-dimensional de Sitter spacetime solutions in string theory has been a vexing quest ever since the discovery of the accelerating expansion of the universe. Building on a recent analysis of bubble-nucleation in the decay of…
We establish Schmutz Schaller's conjecture that the hexagonal lattice is `better' than the square lattice. Schmutz Schaller (Bulletin of the AMS 35 (1998), p. 201), motivated by considerations from hyperbolic geometry, conjectured that in…
Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao…
We present a detailed description of our void finding algorithm which is an extension of the prescription by Hoyle and Vogeley (2002). We include a discussion of the reproducibility and robustness of the algorithm as well as the statistical…
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packings are in fact optimal. When applied to the previously…
This paper provides triangular spherical designs for the complex unit sphere $\Omega^d$ by exploiting the natural correspondence between the complex unit sphere in $d$ dimensions and the real unit sphere in $2d-1$. The existence of…
Recent work Bobienski-Nurowski on 5-dimensional Riemannian manifolds with an SO(3) structure prompts us to investigate which Lie groups admit such a geometry. The case in which the SO(3) structure admits a compatible connection with torsion…