Related papers: A conceptual breakthrough in sphere packing
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
Choice of an appropriate (3+1)-foliation of spacetime or a (2+1)-foliation of the Cauchy space, leads often to a substantial simplification of various mathematical problems in General Relativity Theory. We propose a new method to construct…
Packings of identical objects have fascinated both scientists and laymen alike for centuries, in particular the sphere packings and the packings of identical regular tetrahedra. Mathematicians have tried for centuries to determine the…
We generalize the notion of Monk's schema in such a way to integrate finite dimensions. This allows us to lift a plathora of deep results proved for finite dimensions to the infinite dimensional case, like the solution to problem 2.12 in…
We apply a recent one-dimensional algorithm for predicting random close packing fractions of polydisperse hard spheres [Farr and Groot, J. Chem. Phys. 133, 244104 (2009)] to the case of lognormal distributions of sphere sizes and mixtures…
Consider a polygon P and all neighboring circles (circles going through three consecutive vertices of P). We say that a neighboring circle is extremal if it is empty (no vertices of P inside) or full (no vertices of P outside). It is well…
Sphere recognition is known to be undecidable in dimensions five and beyond, and no polynomial time method is known in dimensions three and four. Here we report on positive and negative computational results with the goal to explore the…
New examples of noncommutative 4-spheres are introduced.
In this paper, we give a survey of various sphere theorems in geometry. These include the topological sphere theorem of Berger and Klingenberg as well as the differentiable version obtained by the authors. These theorems employ a variety of…
We consider algorithms that, from an arbitrarily sampling of $N$ spheres (possibly overlapping), find a close packed configuration without overlapping. These problems can be formulated as minimization problems with non-convex constraints.…
We study a variety of problems about homothets of sets related to the Kakeya conjecture. In particular, we show many of these problems are equivalent to the arithmetic Kakeya conjecture of Katz and Tao. We also provide a proof that the…
The pochette surgery, which was discovered by Iwase and Matsumoto, is a generalization of the Gluck surgery. In this paper we construct infinitely many embeddings of a pochette into the 4-sphere and prove that homotopy 4-spheres obtained…
In this paper, we prove an extension theorem for spheres of square radii in $\mathbb{F}_q^d$, which improves a result obtained by Iosevich and Koh (2010). Our main tool is a new point-hyperplane incidence bound which will be derived via a…
In this work we blend interpolation theory with numerical integration, constructing an interpolator based on integrals over $n$-dimensional balls. We show that, under hypotheses on the radius of the $n$-balls, the problem can be treated as…
In this paper we prove uniform Hausdorff and packing dimension results for the images of a large family of Markov processes. The main tools are the two covering principles of Xiao (second author). As applications, uniform Hausdorff and…
The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm…
The VC-dimension, introduced by Vapnik and Chervonenkis in 1968 in the context of learning theory, has in recent years provided a rich source of problems in combinatorial geometry. Given $E\subseteq \mathbb{F}_q^d$ or $E\subseteq…
Given a set $X$ and a collection ${\mathcal H}$ of functions from $X$ to $\{0,1\}$, the VC-dimension measures the complexity of the hypothesis class $\mathcal{H}$ in the context of PAC learning. In recent years, this has been connected to…