Related papers: The Honeycomb Problem on the Sphere
In this paper we prescribe a fourth order conformal invariant 9the Paneitz Curvature) on five and six spheres. Using dynamical and topological methods involving the study of critical points at infinity of the associated variational problem,…
We show that the hexagonal honeycomb is optimal among convex periodic tessellations of the plane, provided the cost functional is lower semicontinuous with respect to the Hausdorff convergence, and decreasing under Steiner symmetrization.
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
We study a polyhedron with $n$ vertices of fixed volume having minimum surface area. Completing the proof of Fejes Toth, we show that all faces of a minimum polyhedron are triangles, and further prove that a minimum polyhedron does not…
We introduce a restricted four body problem in a 2+2 configuration extending the classical Sitnikov problem to the Double Sitnikov problem. The secondary bodies are moving on the same perpendicular line to the planewhere the primaries…
In 1946 Fine and Niven posed problem E724, asking to demonstrate that every hypercube can be tiled by any number of hypercubic tiles larger than some value. This requires only basic number theory, but the problem of finding the smallest…
In this paper we consider the Hamilton cycle problem in the rectangular meshes with at most two faulty nodes.We prove that this problem is solvable in polynomial time with a corresponding algorithm. We provided an entirely new approach to…
We give a rigorous computer-assisted proof that the triangular bi-pyramid is the unique configuration of 5 points on the 2-sphere that globally minimizes the Coulomb (1/r) potential. We also prove the same result for the (1/r^2) potential.…
This is one chapter of the collection of problems in cosmology, in which we assemble the problems, with solutions, that concern one of the most distinctive features of general relativity and cosmology---the horizons. The first part gives an…
For fixed $d\geq 3$, we construct subsets of the $d$-dimensional lattice cube $[n]^d$ of size $n^{\frac{3}{d + 1} - o(1)}$ with no $d+2$ points on a sphere or a hyperplane. This improves the previously best known bound of…
The existence of minimizers in the fractional isoperimetric problem with multiple volume constraints is proved, together with a partial regularity result.
Spherical manifolds yield cosmic spaces with positive curvature. They result by closing pieces from the sphere used by Einstein for his initial cosmology. Harmonic analysis on the manifolds aims at explaining the observed low amplitudes at…
This paper introduces a geometrically constrained variational problem for the area functional. We consider the area restricted to the langrangian surfaces of a Kaehler surface, or, more generally, a symplectic 4-manifold with suitable…
Congruent polygons are congruent in angles as well as in edge lengths. We concentrate on the angle aspect, and investigate how tilings of the sphere by congruent pentagons can be determined by the angle information only. We also investigate…
We prove that the minimizer in the N\'ed\'elec polynomial space of some degree p > 0 of a discrete minimization problem performs as well as the continuous minimizer in H(curl), up to a constant that is independent of the polynomial degree…
In this paper we report on massive computer experiments aimed at finding spherical point configurations that minimize potential energy. We present experimental evidence for two new universal optima (consisting of 40 points in 10 dimensions…
We show that any convex region which contains a unit segment, an equilateral triangle of sides 1/2, and a square of side 1/3 always has area at least 0.227498. Using grid-search algorithm, we attempt to find a configuration of these three…
We obtain in arbitrary codimension a removability result on the order of singularity of Willmore surfaces realising the width of Willmore min-max problems on spheres. As a consequence, out of the twelve families of non-planar minimal…
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…
The Half-Space Matching (HSM) method has recently been developed as a new method for the solution of 2D scattering problems with complex backgrounds, providing an alternative to Perfectly Matched Layers (PML) or other artificial boundary…