Abstract:Abstract. In this paper we report on massive computer experiments aimed at finding spherical point configurations that minimize potential energy. We present experimental evidence for two new universal optima (consisting of 40 points in 10 dimensions and 64 points in 14 dimensions), as well as evidence that there are no others with at most 64 points. We also describe several other new polytopes, and we present new geometrical descriptions of some of the known universal optima.
“…Since it has maximum norm among all vertices, the corresponding facet is closest to the origin and has the largest possible circumsphere among all other facets of C(Λ 24 ). This solves a conjecture of Ballinger, Blekherman, Cohn, Giansiracusa, Kelly, and Schürmann [2,Sect. 3.7].…”
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we classify the facets of the contact polytope of the Leech lattice up to symmetry. There are 1, 197, 362, 269, 604, 214, 277, 200 many facets in 232 orbits.
“…Since it has maximum norm among all vertices, the corresponding facet is closest to the origin and has the largest possible circumsphere among all other facets of C(Λ 24 ). This solves a conjecture of Ballinger, Blekherman, Cohn, Giansiracusa, Kelly, and Schürmann [2,Sect. 3.7].…”
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we classify the facets of the contact polytope of the Leech lattice up to symmetry. There are 1, 197, 362, 269, 604, 214, 277, 200 many facets in 232 orbits.
“…If the function is strictly completely monotonic, then the universally optimal solution is also unique. For points on the surface of a sphere, the only known universally optimal solutions are [39,40] N = 1-4, 6, and 12; that is, a single point, antipodal points, points forming an equilateral triangle on the equator, and tetrahedral, octahedral, and icosahedral arrangement of points. For our purposes, this means certain desired point arrangements (e.g.…”
Section: Discussionmentioning
confidence: 99%
“…Restricting themselves to isotropic pair potentials and identical particles, Cohn and Kumar [42] constructed separate decreasing convex potential energy functions that have cubic (N=8) and dodecahedral (N=20) configurations as their minimum. Thus references [39,40,42] imply that to assemble certain clusters, it will be necessary to use more complicated HPs with carefully constructed potentials, including non-completely monotonic or anisotropic interactions.…”
We consider the thermodynamically driven self-assembly of spheres onto the surface of a central sphere. This assembly process forms self-limiting, or terminal, anisotropic clusters (N -clusters) with well defined structures. We use Brownian dynamics to model the assembly of N -clusters varying in size from two to twelve outer spheres, and free energy calculations to predict the expected cluster sizes and shapes as a function of temperature and inner particle diameter. We show that the arrangements of outer spheres at finite temperatures are related to spherical codes, an ideal mathematical sequence of points corresponding to densest possible sphere packings. We demonstrate that temperature and the ratio of the diameters of the inner and outer spheres dictate cluster morphology and dynamics. We find that some N -clusters exhibit collective particle rearrangements, and these collective modes are unique to a given cluster size N . We present a surprising result for the equilibrium structure of a 5-cluster, which prefers an asymmetric square pyramid arrangement over a more symmetric arrangement. Our results suggest a promising way to assemble anisotropic building blocks from constituent colloidal spheres.
“…Evidently every simplicial polytope is basis-simplicial. For perhaps less contrived examples of basis-simplicial polytopes than Example 7.2 we mention the Dirichlet-Voronoi-cells (DV-cells) of the root lattices D 3 , D 4 , and E 8 (convex hull of their shortest non-zero vectors) and some related universally optimal spherical polytopes (see [8]). Their boundaries consist of regular cross polytopes and regular simplices only and they thus have at most two orbits of basis with respect to their symmetry group (cf.…”
Abstract. We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decomposition methods, which reduce the problem to a number of lower dimensional subproblems. These methods have been successfully used by different authors in special contexts. Moreover, we sketch an incremental method, which is a generalization of Fourier-Motzkin elimination, and we give some ideas how symmetry can be exploited using pivots.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.