Upper bounds for packings of spheres of several radii

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 for packings of spherical caps and of convex bodies through the use of semidefinite programming. We perform explicit computations, obtaining new bounds for packings of spherical caps of two different sizes and for binary sphere packings. We also slightly improve bounds for the classical problem of packing identical spheres.Comment: 31 page

Phase field approach to optimal packing problems and related Cheeger clusters

In a fixed domain of $\Bbb{R}^N$ we study the asymptotic behaviour of optimal clusters associated to $\alpha$-Cheeger constants and natural energies like the sum or maximum: we prove that, as the parameter $\alpha$ converges to the "critical" value $\Big (\frac{N-1}{N}\Big ) _+$, optimal Cheeger clusters converge to solutions of different packing problems for balls, depending on the energy under consideration. As well, we propose an efficient phase field approach based on a multiphase Gamma convergence result of Modica-Mortola type, in order to compute $\alpha$-Cheeger constants, optimal clusters and, as a consequence of the asymptotic result, optimal packings. Numerical experiments are carried over in two and three space dimensions

Stable Frank-Kasper phases of self-assembled, soft matter spheres

Single molecular species can self-assemble into Frank Kasper (FK) phases, finite approximants of dodecagonal quasicrystals, defying intuitive notions that thermodynamic ground states are maximally symmetric. FK phases are speculated to emerge as the minimal-distortional packings of space-filling spherical domains, but a precise quantitation of this distortion and how it affects assembly thermodynamics remains ambiguous. We use two complementary approaches to demonstrate that the principles driving FK lattice formation in diblock copolymers emerge directly from the strong-stretching theory of spherical domains, in which minimal inter-block area competes with minimal stretching of space-filling chains. The relative stability of FK lattices is studied first using a diblock foam model with unconstrained particle volumes and shapes, which correctly predicts not only the equilibrium {\sigma} lattice, but also the unequal volumes of the equilibrium domains. We then provide a molecular interpretation for these results via self-consistent field theory, illuminating how molecular stiffness regulates the coupling between intra-domain chain configurations and the asymmetry of local packing. These findings shed new light on the role of volume exchange on the formation of distinct FK phases in copolymers, and suggest a paradigm for formation of FK phases in soft matter systems in which unequal domain volumes are selected by the thermodynamic competition between distinct measures of shape asymmetry.Comment: 40 pages, 22 figure

Dense packing on uniform lattices

We study the Hard Core Model on the graphs ${\rm {\bf \scriptstyle G}}$ obtained from Archimedean tilings i.e. configurations in $\scriptstyle \{0,1\}^{{\rm {\bf G}}}$ with the nearest neighbor 1's forbidden. Our particular aim in choosing these graphs is to obtain insight to the geometry of the densest packings in a uniform discrete set-up. We establish density bounds, optimal configurations reaching them in all cases, and introduce a probabilistic cellular automaton that generates the legal configurations. Its rule involves a parameter which can be naturally characterized as packing pressure. It can have a critical value but from packing point of view just as interesting are the noncritical cases. These phenomena are related to the exponential size of the set of densest packings and more specifically whether these packings are maximally symmetric, simple laminated or essentially random packings.Comment: 18 page

Minimal surfaces from circle patterns: Geometry from combinatorics

We suggest a new definition for discrete minimal surfaces in terms of sphere packings with orthogonally intersecting circles. These discrete minimal surfaces can be constructed from Schramm's circle patterns. We present a variational principle which allows us to construct discrete analogues of some classical minimal surfaces. The data used for the construction are purely combinatorial--the combinatorics of the curvature line pattern. A Weierstrass-type representation and an associated family are derived. We show the convergence to continuous minimal surfaces.Comment: 30 pages, many figures, some in reduced resolution. v2: Extended introduction. Minor changes in presentation. v3: revision according to the referee's suggestions, improved & expanded exposition, references added, minor mistakes correcte

Methodology to Solve Multi-Dimentional Sphere Packing Problems

This paper discusses the problem of optimally packing spheres of various dimensions into containers of arbitrary geometrical shapes. According to the international classification, this problem belongs to Sphere Packing Problems (SPPs). The aim of this work is to create an integrated methodology for solving SPPs.В статті розглядається задача оптимального розміщення куль різної розмірності в контейнерах довільних геометричних форм. Згідно з міжнародною класифікацією ця задача належить до класу SPP (Sphere Packing Problems). Метою даної роботи є створення єдиної методології розв’язання задач SPP.В статье рассматривается задача оптимального размещения шаров различной размерности в контейнерах произвольных геометрических форм. Согласно международной классификации эта задача относится к классу SPP (Sphere Packing Problems). Целью данной работы является создание единой методологии решения задач SPP