Related papers: The Honeycomb Problem on the Sphere
In a convex mosaic in $\mathbb{R} ^d$ we denote the average number of vertices of a cell by $\bar v$ and the average number of cells meeting at a node by $\bar n$. Except for the $d=2$ planar case, there is no known formula prohibiting…
The classical Heron problem states: \emph{on a given straight line in the plane, find a point $C$ such that the sum of the distances from $C$ to the given points $A$ and $B$ is minimal}. This problem can be solved using standard geometry or…
Inspired by a planar partitioning problem involving multiple improper chambers, this article investigates using classical techniques what can be said of the existence, uniqueness, and regularity of minimizers in a certain free-endpoint…
In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can…
We consider the variational problem of minimizing an anisotropic perimeter functional under a volume constraint in a Euclidean convex domain. We extend to this setting analytical properties of the isoperimetric profile, topological features…
In a recent issue of this journal, Mordukhovich et al.\ pose and solve an interesting non-differentiable generalization of the Heron problem in the framework of modern convex analysis. In the generalized Heron problem one is given $k+1$…
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…
We prove that the optimal cluster problem for the sum of the first Robin eigenvalue of the Laplacian, in the limit of a large number of convex cells, is asymptotically solved by (the Cheeger sets of) the honeycomb of regular hexagons. The…
We solve the oscillation stability problem for the Urysohn sphere, an analog of the distortion problem for the Hilbert space in the context of the Urysohn universal metric space. This is achieved by solving a purely combinatorial problem…
This article answers an important theoretical question: How many different subdivisions of the hexahedron into tetrahedra are there? It is well known that the cube has five subdivisions into 6 tetrahedra and one subdivision into 5…
Let \Delta be a (d-1)-dimensional homology sphere on n vertices with m minimal non-faces. We consider the invariant \alpha := m - (n-d) and prove that for a given value of \alpha, there are only finitely many homology spheres that cannot be…
The problem of packing equal spheres in a spherical container is a classic global optimization problem, which has attracted enormous studies in academia and found various applications in industry. This problem is computationally…
We consider the problem of a sphere rolling of a curved surface and solve it by mapping it to the precession of a spin 1/2 in a magnetic field of variable magnitude and direction. The mapping can be of pedagogical use in discussing both…
We study edge-to-edge tilings of the sphere by edge congruent pentagons, under the assumption that there are tiles with all vertices having degree 3. We develop the technique of neighborhood tilings and apply the technique to completely…
Several commonly observed physical and biological systems are arranged in shapes that closely resemble an honeycomb cluster, that is, a tessellation of the plane by regular hexagons. Although these shapes are not always the direct product…
The standard simplex in R^n, also known as the probability simplex, is the set of nonnegative vectors whose entries sum up to 1. They frequently appear as constraints in optimization problems that arise in machine learning, statistics, data…
Enneper's wire, the image of the circle of radius $R$ under Enneper's surface, bounds exactly three minimal surfaces for $R$ between 1 and $\sqrt 3$, and these three surfaces depend continuously on $R$. The other two surfaces (besides…
We construct closed embedded minimal surfaces in the round three-sphere, resembling two parallel copies of the equatorial two-sphere, joined by small catenoidal bridges symmetrically arranged either along two parallel circles of the…
In this paper, we study the problem of computing a homotopy from a planar curve $C$ to a point that minimizes the area swept. The existence of such a minimum homotopy is a direct result of the solution of Plateau's problem. Chambers and…
The fundamental problem of how tunneling in thermal medium is completed is addressed, and a new time scale of order 1/friction for its termination, which is usually much shorter than the Hubble time, is pointed out. Enhanced non-linear…