Related papers: Contact numbers for sphere packings
This paper is devoted to the study of particular geometrically defined intersection classes of graphs. Those were previously studied by Magnant and Martin, who proved that these graphs have arbitrary large chromatic number, while being…
In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid or jammed if it is isolated within the space of packings. In other words, aside from applying a global isometry, the packing cannot be…
Bead packs of up to 150,000 mono-sized spheres with packing densities ranging from 0.58 to 0.64 have been studied by means of X-ray Computed Tomography. These studies represent the largest and the most accurate description of the structure…
Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and…
A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…
All possible non-isomorphic arrangements of 12 spheres kissing a central sphere (the Gregory-Newton problem) are obtained for the sticky-hard-sphere (SHS) model, and subsequently projected by geometry optimization onto a set of structures…
We survey several old and new problems related to the number of simplicial spheres, the number of neighborly simplicial spheres, the number of centrally symmetric simplicial spheres that are cs-neighborly, and the transversal numbers of…
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…
Envelopes of parameterized families of plane curves is an important topic, both for the mathematics involved and for its applications. Nowadays, it is generally studied in a technology-rich environment, and automated methods are developed…
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.…
When two solids are squeezed together they will in general not make atomic contact everywhere within the nominal (or apparent) contact area. This fact has huge practical implications and must be considered in many technological…
This paper begins the study of relations between Riemannian geometry and global properties of contact structures on 3-manifolds. In particular we prove an analog of the sphere theorem from Riemannian geometry in the setting of contact…
In 1694, Gregory and Newton proposed the problem to determine the kissing number of a rigid material ball. This problem and its higher dimensional generalization have been studied by many mathematicians, including Minkowski, van der…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
Generalised contact structures are studied from the point of view of reduced generalised complex structures, naturally incorporating non-coorientable structures as non-trivial fibering. The infinitesimal symmetries are described in detail,…
In this article, using the computer, are enumerated all locally-rigid packings by $N$ congruent circles (spherical caps) on the unit sphere ${\Bbb S}^2 $ with $N < 12.$ This is equivalent to the enumeration of irreducible spherical contact…
This paper is a survey of recent advances as well as open problems in the study of face numbers of centrally symmetric simplicial polytopes and spheres. The topics discussed range from neighborliness of centrally symmetric polytopes and the…
We study low-dimensional problems in topology and geometry via a study of contact and Cauchy-Riemann ($CR$) structures. A contact structure is called spherical if it admits a compatible spherical $CR$ structure. We will talk about spherical…
Using elementary number theory, we prove several results about the complexity of CR mappings between spheres. It is known that CR mappings between spheres, invariant under finite groups, lead to sharp bounds for degree estimates on real…