Related papers: A game of packings
We study balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largest circle's diameter to the smallest circle's diameter is polynomial in the number of circles. We provide a number of…
Determining the space of free discrete two generator groups of M\"obius transformations is an old and difficult problem. In this paper we show how to construct large balls of full dimension in this space. To do this, we begin with a marked…
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 note we prove that the centers of a closed chain of circles for which every two consecutive members meet in the points of two given circles form a tangent polygon of a conic.
For any integer $n\geq 2$, we construct an infinite family of Stein fillable contact $(4n-1)$-manifolds each of which admits infinitely many pairwise homotopy inequivalent Stein fillings.
We present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal…
Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…
We define spinors for pairs of tangent disks in the Euclidean plane and prove a number of theorems, one of which may be interpreted as a "square root of Descartes Theorem". In any Apollonian disk packing, spinors form a network. In the…
We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and…
We construct families of circles in the plane such that their tangency graphs have arbitrarily large girth and chromatic number. This provides a strong negative answer to Ringel's circle problem (1959). The proof relies on a…
In this article an explicit method (relying on representation theory) to construct packings in Grassmannian space is presented. Infinite families of configurations having only one non-trivial set of principal angles are found using…
Any four mutually tangent spheres in R^3 determine three coincident lines through opposite pairs of tangencies. As a consequence, we define two new triangle centers.
We prove that the infinitely generated Apollonian gasket has full Hausdorff dimension spectrum. Our proof, which is computer assisted, relies on an iterative technique introduced by the first three authors in [3] and on a flexible method…
A geometric inequality among three triangles, originating in circle packing problems, is introduced. In order to prove it, we reduce the original formulation to the nonnegativity of a particular polynomial in four real indeterminates.…
In a previous paper we introduced examples of Hamiltonian mappings with phase space structures resembling circle packings. We now concentrate on one particular mapping and present numerical evidence which supports the conjecture that the…
We investigate the entanglement properties of multiparticle systems, concentrating on the case where the entanglement is robust against disposal of particles. Two qubits -belonging to a multipartite system- are entangled in this sense iff…
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…
Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are effectively spacing out the objects as far apart as possible so…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
We prove that if a curve of a non-isotrivial family of abelian varieties over a curve contains infinitely many isogeny orbits of a finitely generated subgroup of a simple abelian variety then it is special.