Related papers: The Antipode Construction for Sphere Packings
Many remarkably robust, rapid and spontaneous self-assembly phenomena in nature can be modeled geometrically starting from a collection of rigid bunches of spheres. This paper highlights the role of symmetry in sphere-based assembly…
An approximate but straight forward projection method to molecular many alpha-particle states is proposed and the overlap to the shell model space is determined. The resulting space is in accordance with the shell model, but still contains…
Spherical particles confined to a sphere surface cannot pack densely into a hexagonal lattice without defects. In this study, we use hard particle Monte Carlo simulations to determine the effects of continuously deformable shape anisotropy…
A spherical $t$-design is a finite subset $X$ of the unit sphere such that every polynomial of degree at most $t$ has the same average over $X$ as it does over the entire sphere. Determining the minimum possible size of spherical designs,…
We apply a recent one-dimensional algorithm for predicting random close packing fractions of polydisperse hard spheres [Farr and Groot, J. Chem. Phys. 133, 244104 (2009)] to the case of lognormal distributions of sphere sizes and mixtures…
The random packing fraction of binary particles in D-dimensional Euclidean space R^D is studied using a geometric approach. First, the binary packing fraction of assemblies with small size difference are studied, using the excluded volume…
Particle size polydispersity can help to inhibit crystallization of the hard-sphere fluid into close-packed structures at high packing fractions and thus is often employed to create model glass-forming systems. Nonetheless, it is known that…
Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic…
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…
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…
The theory of designs is an important branch of combinatorial mathematics. It is well-known in the theory of designs that a finite subset of a sphere is a tight spherical 1-design if and only if it is a pair of antipodal points. On the…
A natural oriented (2k+2)-chain in CP^{2k+1} with boundary twice RP^{2k+1}, its complex shade, is constructed. Via intersection numbers with the shade, a new invariant, the shade number of k-dimensional subvarieties with normal vector…
The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…
The exploration of the densest sphere packings is a fundamental problem in mathematics and a wide variety of sciences including materials science. We present our exhaustive computational exploration of the densest ternary sphere packings…
Vector sets with optimal coherence according to the Welch bound cannot exist for all pairs of dimension and cardinality. If such an optimal vector set exists, it is an equiangular tight frame and represents the solution to a Grassmannian…
Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and…
Packings of identical objects have fascinated both scientists and laymen alike for centuries, in particular the sphere packings and the packings of identical regular tetrahedra. Mathematicians have tried for centuries to determine the…
The problem of constructing a limit series of Penrose type partitions of a two-dimensional sphere is solved, which makes it possible to model quasicrystals possessing a point icosahedral group symmetry Ih. Images of polyhedron models are…
We construct examples of embedded flexible cross-polytopes in the spheres of all dimensions. These examples are interesting from two points of view. First, in dimensions 4 and higher, they are the first examples of embedded flexible…
A basic problem in constant dimension subspace coding is to determine the maximal possible size ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in ${\bf F}_q^n$ such that the subspace distance satisfies…