Related papers: Experimental study of energy-minimizing point conf…
The problem of twelve spheres is to understand, as a function of $r \in (0,r_{max}(12)]$, the configuration space of $12$ non-overlapping equal spheres of radius $r$ touching a central unit sphere. It considers to what extent, and in what…
We investigate the nonlocal energy corresponding to the $p$-oscillation of the unit normal vector for hypersurfaces, or the unit tangent vector for curves. The energy satisfies geometric inequalities with optimal constants $c(n,p)$ and…
We derive upper bounds for the potential energy of spherical designs of cardinality close to the Delsarte-Goethals-Seidel bound. These bounds are obtained by linear programming with the use of the Hermite interpolating polynomial of the…
We study point configurations on the torus $\mathbb T^d$ that minimize interaction energies with tensor product structure which arise naturally in the context of discrepancy theory and quasi-Monte Carlo integration. Permutation sets on…
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…
We consider the common problem setting of an elastic sphere impacting on a flexible beam. In contrast to previous studies, we analyze the modal energy distribution induced by the impact, having in mind the particular application of impact…
How should we place $n$ great circles on a sphere to minimize the furthest distance between a point on the sphere and its nearest great circle? Fejes T\'oth conjectured that the optimum is attained by placing $n$ circles evenly spaced all…
The aim of this paper is to highlight recent progress in using conic optimization methods to study geometric packing problems. We will look at four geometric packing problems of different kinds: two on the unit sphere -- the kissing number…
We give linear-time quasiconvex programming algorithms for finding a Moebius transformation of a set of spheres in a unit ball or on the surface of a unit sphere that maximizes the minimum size of a transformed sphere. We can also use…
The theory of modular forms and spherical harmonic analysis are applied to establish new best bounds towards the counting and equidistribution of rational points on spheres and other higher dimensional ellipsoids, in what may be viewed as a…
In this article we provide an experimental algorithm that in many cases gives us an upper bound of the global infimum of a real polynomial on $\R^{n}$. It is very well known that to find the global infimum of a real polynomial on $\R^{n}$,…
We describe a global optimization technique using `basin-hopping' in which the potential energy surface is transformed into a collection of interpenetrating staircases. This method has been designed to exploit the features which recent work…
It is shown here how prior estimates on the local shape of the universe can be used to reduce, to a small region, the full parameter space for the search of circles in the sky. This is the first step towards the development of efficient…
We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $\Gamma$-convergence result and we show some numerical results. We compare our results to those…
Let $n\geq 3$ and let $\Omega \subset \mathbb{R}^n$ be a $\mathcal{C}^1$ bounded domain which is diffeomorphic to a ball. We investigate here the problem of finding critical points of the $n$-energy in the space $\mathcal{I}=\{v\in…
We have employed Particle Swarm Optimization to address a stochastic variant of the Smallest Enclosing Sphere estimation problem. An efficient algorithm has been developed to ascertain the optimal center and radius of a sphere encompassing…
In this paper we explore the connections between minimizers of the discrete logarithmic energy on the 2-dimensional sphere, univariate polynomials with optimal condition number in the Shub-Smale sense and a quotient involving norms of…
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…
The first 195 spherical codes for the global minima of 1 to 65 points on S2 have been obtained for 3 types of potentials: logarithmic, Coulomb, called the Thomson problem, and the inverse square law, with 77, 38, and 38 digits precision…
Let N(n, t) be the minimal number of points in a spherical t-design on the unit sphere S^n in R^{n+1}. For each n >= 3, we prove a new asymptotic upper bound N(n, t) <= C(n)t^{a_n}, where C(n) is a constant depending only on n, a_3 <= 4,…