Related papers: Packing Meets Topology
We show that Euclidean geometry in suitably high dimension can be expressed as a theory of orthogonality of subspaces with fixed dimensions and fixed dimension of their meet.
A packing of disks in the plane is a set of disks with disjoint interiors. This paper is a survey of some open questions about such packings. It is organized into five themes: compacity, conjugacy, density, uniformity and computability.
Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…
We derive an integral formula for the linking number of two submanifolds of the n-sphere S^n, of the product S^n x R^m, and of other manifolds which appear as "nice" hypersurfaces in Euclidean space. The formulas are geometrically…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
Let X be a symmetric space of non-compact type or a locally finite, strongly transitive Euclidean building, and let B denote the geodesic boundary of X. We reduce the study of visual limits of maximal flats in X to the study of limits of…
This review describes the diversity of jammed configurations attainable by frictionless convex nonoverlapping (hard) particles in Euclidean spaces and for that purpose it stresses individual-packing geometric analysis. A fundamental feature…
In an earlier note [arXiv:2301.00295] it was shown that there is an upper bound to the number of disjoint Hopf links (and certain related links) that can be embedded in the unit cube where there is a fixed separation required between the…
The article presents the mathematical sequences describing circle packing densities in four different geometric configurations involving a hexagonal lattice based equal circle packing in the Euclidian plane. The calculated sequences take…
We consider the moduli spaces $\mathcal{M}_d(\ell)$ of a closed linkage with n links and prescribed lengths in d-dimensional Euclidean space. For d>3 these spaces are no longer manifolds generically, but they have the structure of a…
We consider the moduli spaces $\mathcal{M}_d(\ell)$ of a closed linkage with $n$ links and prescribed lengths $\ell\in \mathbb{R}^n$ in $d$-dimensional Euclidean space. For $d>3$ these spaces are no longer manifolds generically, but they…
This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each…
This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.
A standard problem in applied topology is how to discover topological invariants of data from a noisy point cloud that approximates it. We consider the case where a sample is drawn from a properly embedded C1-submanifold without boundary in…
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…
We provide the first known upper bounds for the packing dimension of weighted singular and weighted $\omega$-singular matrices. We also prove upper bounds for these sets when intersected with fractal subsets. The latter results, even in the…
In this paper we present a mathematical framework on linking of embeddings of compact topological spaces into Euclidean spaces and separability of linked embeddings under a specific class of dimension reduction maps. As applications of the…
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…
Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the…
In this paper we give a geometric argument for bounding the diameter of a connected compact surface (with boundary) of arbitrary codimension in Euclidean space in terms of Topping's diameter bound for closed surfaces (without boundary). The…