Related papers: Experimental study of energy-minimizing point conf…
We study the limit computability of finding a global optimum of a continuous function. We give a short proof to show that the problem of checking whether a point is a global minimum is not limit computable. Thereby showing the same for the…
The problems of determining the optimal power allocation, within maximum power bounds, to (i) maximize the minimum Shannon capacity, and (ii) minimize the weighted latency are considered. In the first case, the global optima can be achieved…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
Locating the global minimum of a complex potential energy surface is facilitated by considering a homotopy, namely a family of surfaces that interpolate continuously from an arbitrary initial potential to the system under consideration.…
In statistical dimensionality reduction, it is common to rely on the assumption that high dimensional data tend to concentrate near a lower dimensional manifold. There is a rich literature on approximating the unknown manifold, and on…
In this paper we aim to determine the baryon numbers at which the minimal energy Skyrmion has icosahedral symmetry. By comparing polyhedra which arise as minimal energy Skyrmions with the dual of polyhedra that minimize the energy of…
In this article we present a unified treatment for obtaining bounds on the potential energy of codes in the general context of polynomial metric spaces (PM-spaces). The lower bounds we derive via the linear programming (LP) techniques of…
A `polydisperse' system has an infinite number of conserved densities. We give a rational procedure for projecting its infinite-dimensional free energy surface onto a subspace comprising a finite number of linear combinations of densities…
Each non-zero point in $\mathbb{R}^d$ identifies a closest point $x$ on the unit sphere $\mathbb{S}^{d-1}$. We are interested in computing an $\epsilon$-approximation $y \in \mathbb{Q}^d$ for $x$, that is exactly on $\mathbb{S}^{d-1}$ and…
We determine the maximal number of systoles among all spheres with $n$ punctures endowed with a complete Riemannian metric of finite area.
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…
In their seminal 1981 article, Sacks-Uhlenbeck famously proved the existence of non-trivial harmonic 2-spheres in every closed Riemannian manifold with non-zero second homotopy group. Their arguments heavily rely on PDE techniques. The…
In this paper, we investigate energy-minimizing curves with fixed endpoints $p$ and $q$ in a constrained space. We prove that when one of the endpoints, say $p$, is fixed, the set of points $q$ for which the energy-minimizing curve is not…
We study configuration spaces of hard spheres in a bounded region. We develop a general Morse-theoretic framework, and show that mechanically balanced configurations play the role of critical points. As an application, we find the precise…
We investigate the problem of density estimation on the unit circle and the unit sphere from a computational perspective. Our primary goal is to develop new density estimators that are both rate-optimal and computationally efficient for…
This paper provides triangular spherical designs for the complex unit sphere $\Omega^d$ by exploiting the natural correspondence between the complex unit sphere in $d$ dimensions and the real unit sphere in $2d-1$. The existence of…
Based on the Delsarte-Yudin linear programming approach, we extend Levenshtein's framework to obtain lower bounds for the minimum $h$-energy of spherical codes of prescribed dimension and cardinality, and upper bounds on the maximal…
An energy functional for orbital based $O(N)$ calculations is proposed, which depends on a number of non orthogonal, localized orbitals larger than the number of occupied states in the system, and on a parameter, the electronic chemical…
Acquiring information on spatial phenomena can be costly and time-consuming. In this context, to obtain reliable global knowledge, the choice of measurement location is a crucial issue. Space-lling designs are often used to control…
Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…