Related papers: Experimental study of energy-minimizing point conf…
We use moment techniques to construct a converging hierarchy of optimization problems to lower bound the ground state energy of interacting particle systems. We approximate (from below) the infinite dimensional optimization problems in this…
We consider the logarithmic Fekete problem, which consists of placing a fixed number of points on the unit sphere in $\mathbb{R}^d$, in such a way that the product of all pairs of mutual Euclidean distances is maximized or, equivalently, so…
We utilize recently introduced linear programming bounds for the energy of periodic configurations in $\mathbb{R}^d$ to construct configurations which are universally optimal among those of the form $\omega_4+L_\beta$, where $\omega_4$ is a…
In this paper, we prove the existence of a spherical $t$-design formed by adding extra points to an arbitrarily given point set on the sphere and, subsequently, deduce the existence of nested spherical designs. Estimates on the number of…
We generalize work of Erdos and Fishburn to study the structure of finite point sets that determine few distinct triangles. Specifically, we ask for a given $t$, what is the maximum number of points that can be placed in the plane to…
Thomson problem is a classical problem in physics to study how $n$ number of charged particles distribute themselves on the surface of a sphere of $k$ dimensions. When $k=2$, i.e. a 2-sphere (a circle), the particles appear at equally…
The consideration of the N-body gravitational problem equations can give to us some class of boundary-value problems defined on the "beem's" construction. One can considere it as weak or so-called finite element method's approximation with…
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…
We find many tight codes in compact spaces, i.e., optimal codes whose optimality follows from linear programming bounds. In particular, we show the existence (and abundance) of several hitherto unknown families of simplices in quaternionic…
In this paper, we prove a geometrical inequality which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is 4+4*sqrt(2). In our method, we have constructed a rectangular…
We have performed a detailed exploration of the energy landscape for configurations of points on the sphere, interacting via the logarithmic potential, and corresponding to local minima of the total energy, up to $N = 160$. The growth of…
Optimization of frame structures is formulated as a~non-convex optimization problem, which is currently solved to local optimality. In this contribution, we investigate four optimization approaches: (i) general non-linear optimization, (ii)…
We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…
We prove existence of equal area partitions of the unit sphere via optimal transport methods, accompanied by diameter bounds written in terms of Monge--Kantorovich distances. This can be used to obtain bounds on the expectation of the…
We study energy minimization for pair potentials among periodic sets in Euclidean spaces. We derive some sufficient conditions under which a point lattice locally minimizes the energy associated to a large class of potential functions. This…
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…
Consider the problem of constructing an experimental design, optimal for estimating parameters of a given statistical model with respect to a chosen criterion. To address this problem, the literature usually provides a single solution.…
Optimal packing of spheres in $\mathbb R^d$ is studied by optimization of the energy $E$ (effective conductivity) of composites with ideally conducting spherical inclusions. It is demonstrated that the minimum of $E$ over locations of…
We compute the minimum number of critical points of a small codimension smooth map between two manifolds. We give as well some partial results for the case of higher codimension when the manifolds are spheres.
Smale's Seventh Problem asks for an efficient algorithm to generate a configuration of $n$ points on the sphere that nearly minimizes the logarithmic energy. As a candidate starting configuration for this problem, Armentano, Beltr\'an and…