Related papers: On the Packing Density Bound in 3-Space
We consider the online bin packing problem under the advice complexity model where the 'online constraint' is relaxed and an algorithm receives partial information about the future requests. We provide tight upper and lower bounds for the…
Given an edge-weighted metric complete graph with $n$ vertices, the maximum weight metric triangle packing problem is to find a set of $n/3$ vertex-disjoint triangles with the total weight of all triangles in the packing maximized. Several…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
Questions surrounding the spatial disposition of particles in various condensed-matter systems continue to pose many theoretical challenges. This paper explores the geometric availability of amorphous many-particle configurations that…
We study translative arrangements of centrally symmetric convex domains in the plane (resp., of congruent balls in the Euclidean $3$-space) that neither pack nor cover. We define their soft density depending on a soft parameter and prove…
We report a recent developement on the theory of upper conical densities. More precicely, we look at what can be said in this respect for other measures than just the Hausdorff measure. We illustrate the methods involved by proving a result…
In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…
In a realistic three-dimensional setup, we simulate the slow deformation of idealized granular media composed of spheres undergoing an axisymmetric triaxial shear test. We follow the self-organization of the spontaneous strain localization…
We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$
We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices)…
We discuss some additivity properties of the simplicial volume for manifolds with boundary: we give proofs of additivity for glueing amenable boundary components and of superadditivity for glueing amenable submanifolds of the boundary, and…
We investigate the nature of randomness in disordered packings of frictional spheres. We calculate the entropy of 3D packings through the force and volume ensemble of jammed matter, a mesoscopic ensemble and numerical simulations using…
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…
In this paper we give lower and upper bounds for the volume growth of a regular hyperbolic simplex, namely for the ratio of the $n$-dimensional volume of a regular simplex and the $(n-1)$-dimensional volume of its facets. In addition to the…
Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for…
Limits of densities belonging to an exponential family appear in many applications, {e.g.} Gibbs models in Statistical Physics, relaxed combinatorial optimization, coding theory, critical likelihood computations, Bayes priors with singular…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…
We present a packing-based approximation algorithm for the $k$-Set Cover problem. We introduce a new local search-based $k$-set packing heuristic, and call it Restricted $k$-Set Packing. We analyze its tight approximation ratio via a…
Given an Apollonian Circle Packing $\mathcal{P}$ and a circle $C_0 = \partial B(z_0, r_0)$ in $\mathcal{P}$, color the set of disks in $\mathcal{P}$ tangent to $C_0$ red. What proportion of the concentric circle $C_{\epsilon} = \partial…
We show that $m$ points and $n$ smooth algebraic surfaces of bounded degree in $\mathbb{R}^3$ satisfying suitable nondegeneracy conditions can have at most $O(m^{\frac{2k}{3k-1}}n^{\frac{3k-3}{3k-1}}+m+n)$ incidences, provided that any…