Related papers: A densest compact planar packing with two sizes of…
Monodisperse circular disks have been collectively packed in confined geometries using a Monte Carlo method where the compaction is propelled by two- dimensional stochastic agitation. We have found that confinement (i.e., finite-size plus…
The densest predicted state of matter is colour-superconducting quark matter, in which quarks near the Fermi surface form a condensate of Cooper pairs. This form of matter may well exist in the core of compact stars, and the search for…
We investigate the build-up of galaxies at z~1 using maps of Halpha and stellar continuum emission for a sample of 57 galaxies with rest-frame Halpha equivalent widths >100 Angstroms in the 3D-HST grism survey. We find that the Halpha…
We identify the largest known lensed images of a single spiral galaxy, lying close to the centre of the distant cluster MACS J1149.5+2223 ($z=0.544$). These images cover a total area of $\simeq 150 \Box\arcsec$ and are magnified $\simeq…
We show that a jammed packing of disks with generic radii, in a generic container, is such that the minimal number of contacts occurs and there is only one dimension of equilibrium stresses. We also point out some connections to packings…
We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is…
A packing of translates of a convex domain in the Euclidean plane is said to be totally separable if any two packing elements can be separated by a line disjoint from the interior of every packing element. This notion was introduced by G.…
We present a high-density relativistic reflection analysis of 21 spectra of six black hole X-ray binaries in the hard state with data from \textit{NuSTAR} and \textit{Swift}. We find that 76\% of the observations in our sample require a…
The optimal packings of n unit discs in the plane are known for those natural numbers n, which satisfy certain number theoretic conditions. Their geometric realizations are the extremal Groemer packings (or Wegner packings). But an extremal…
Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…
We show for the first time that collectively jammed disordered packings of three-dimensional monodisperse frictionless hard spheres can be produced and tuned using a novel numerical protocol with packing density $\phi$ as low as 0.6. This…
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…
In this paper we study congruent and non-congruent hyperball (hypersphere) packings of the truncated regular tetrahedron tilings. These are derived from the Coxeter simplex tilings $\{p,3,3\}$ $(7\le p \in \mathbb{N})$ and $\{5,3,3,3,3\}$…
Using three fiducial Nbody+SPH simulations, we follow the merging of two disk galaxies with a hot gaseous halo component each, and examine whether the merger remnant can be a spiral galaxy. The stellar progenitor disks are destroyed by…
A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…
Given a set of disks in the plane, the goal of the problem studied in this paper is to choose a subset of these disks such that none of its members contains the centre of any other. Each disk not in this subset must be merged with one of…
Tap density of a granular powder is often linked to the flowability via Carr Index that measures how tight a powder can be packed, under an assumption that more easily packed powders usually flow poorly. Understanding how particles are…
We prove that uniformly random packings of copies of a certain simply-connected figure in the plane exhibit global connectedness at all sufficiently high densities, but not at low densities.
In \cite{Sz17-2} we considered hyperball packings in $3$-dimensional hyperbolic space. We developed a decomposition algorithm that for each saturated hyperball packing provides a decomposition of $\HYP$ into truncated tetrahedra. In order…
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…