相关论文: The Honeycomb Problem on the Sphere

We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We present a method to find a partition of a given directed graph…

We review some recent progress on the research of the periodic orbits of the N-body problem,and propose a numerical scheme to determine the spatial doubly-symmetric periodic orbits (SDSPs for short). Both comet- and lunar-type SDSPs in the…

We study the double homology associated to triangulated spheres and present two results. First, we explicitly compute the double homology for minimum degree sphere triangulations. Using a spectral sequence argument, we compute the effect of…

The problem of uniformly placing N points onto a sphere finds applications in many areas. For example, points on the sphere correspond to unit quaternions as well as to the group of rotations SO(3) and the online version of generating…

The minimal spherical cap dispersion ${\rm disp}_{\mathcal{C}}(n,d)$ is the largest number $\varepsilon\in (0,1]$ such that, for every $n$ points on the $d$-dimensional Euclidean unit sphere $\mathbb{S}^d$, there exists a spherical cap with…

An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…

Topology and geometry of a sphere create constraints for particles that lie on its surface which they otherwise do not experience in Euclidean space. Notably, the number of particles and the size of the system can be varied separately,…

We prove existence and regularity of minimisers for the Canham-Helfrich energy in the class of weak (possibly branched and bubbled) immersions of the $2$-sphere. This solves (the spherical case) of the minimisation problem proposed by…

The Fermat-Steiner problem consists in finding all points in a metric space $Y$ such that the sum of distances from each of them to the points from some fixed finite subset of $Y$ is minimal. This problem is investigated for the metric…

The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m-periodic packings). For the case m = 1 (lattice packings), Voronoi proved there are finitely many inequivalent local optima and presented…

We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension $48$, with spheres of radii $r$, such that no two centers…

Stable compact minimal submanifolds of the product of a sphere and any Riemannian manifold are classified whenever the dimension of the sphere is at least three. The complete classification of the stable compact minimal submanifolds of the…

We prove a new lower bound for the almost 20 year old problem of determining the smallest possible size of an essential cover of the $n$-dimensional hypercube $\{\pm 1\}^n$, i.e. the smallest possible size of a collection of hyperplanes…

Given $N$ unit points charges on the surface of a unit conducting sphere, what configuration of charges minimizes the Coulombic energy $\sum_{i>j=1}^N 1/r_{ij}$? Due to an exponential rise in good local minima, finding global minima for…

We investigate the problem of finding the minimum number of pieces necessary for dividing a three-dimensional sphere or a ball and reassembling it to form $n$ congruent copies of the original object, generalising a known result by Raphael…

If the four triangular facets of a tetrahedron can be partitioned into pairs having the same area, then the triangles in each pair must be congruent to one another. A Heron-style formula is then derived for the volume of a tetrahedron…

Topology optimization using gradient search with negative and positive elliptical masks and honeycomb tessellation is presented. Through a novel skeletonization algorithm for topologies defined using filled and void hexagonal…

The Hadwiger-Nelson problem asks for the minimum number of colors, so that each point of the plane can be assigned a single color with the property that no two points unit-distance apart are identically colored. It is now known that the…

In this article we investigate the $N$-point min-max and the max-min polarization problems on the sphere for a large class of potentials in $\mathbb{R}^n$. We derive universal lower and upper bounds on the polarization of spherical designs…

This paper considers the problem of solving a special quartic-quadratic optimization problem with a single sphere constraint, namely, finding a global and local minimizer of…