Related papers: Log-optimal (d+2)-configurations in d-dimensions

We present a generalization of a family of points on $\mathbb{S}^2$, the Diamond ensemble, containing collections of $N$ points on $\mathbb{S}^2$ with very small logarithmic energy for all $N\in\mathbb{N}$. We extend this construction to…

We survey known results and present estimates and conjectures for the next-order term in the asymptotics of the optimal logarithmic energy and Riesz $s$-energy of $N$ points on the unit sphere in $\mathbb{R}^{d+1}$, $d\geq 1$. The…

We use linear programming bounds to analyze point sets in the torus with respect to their optimality for problems in discrepancy theory and quasi-Monte Carlo methods. These concepts will be unified by introducing tensor product energies. We…

We consider the nonconvex minimization problem, with quartic objective function, that arises in the exact recovery of a configuration matrix $P\in \R^{nd}$ of $n$ points when a Euclidean distance matrix, \EDMp, is given with embedding…

We show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…

We consider pairwise interaction energies and we investigate their minimizers among lattices with prescribed minimal vectors (length and coordination number), i.e. the one corresponding to the crystal's bonds. In particular, we show the…

We show that, for every set of $n$ points in the $d$-dimensional unit cube, there is an empty axis-parallel box of volume at least $\Omega(d/n)$ as $n\to\infty$ and $d$ is fixed. In the opposite direction, we give a construction without an…

We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$ in $\mathbb R^{d+1}$ of the total potential of a point configuration $\omega_N\subset S^{d}$ which is a spherical $(2m-1)$-design contained…

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

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…

We give two precise estimates for the Green energy of a discrete charge, concentrated in the points on the circles, with respect to the concentric rotation domain in the d-dimensional Euclidean space, d>2.The proof is based on the…

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…

A finite point set in $\mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $\alpha_d(N)$ be the largest integer such that any set of $N$ points in $\mathbb{R}^d$, with no $d + 2$ members on a common…

We focus here on the analysis of the regularity or singularity of solutions $\Om_{0}$ to shape optimization problems among convex planar sets, namely: $$ J(\Om_{0})=\min\{J(\Om),\ \Om\ \textrm{convex},\ \Omega\in\mathcal S_{ad}\}, $$ where…

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Following a review of related results in rigidity theory, we provide a construction to obtain generically universally rigid frameworks with the minimum number of edges, for any given set of n nodes in two or three dimensions. When a set of…

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…

A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most $2^{d+1}-2$ neighbourly simplices in $\mathbb R^d$, is presented.

We consider the minimal discrete and continuous energy problems on the unit sphere $\mathbb{S}^d$ in the Euclidean space $\mathbb{R}^{d+1}$ in the presence of an external field due to finitely many localized charge distributions on…

We address the following generalization $P$ of the Lowner-John ellipsoid problem. Given a (non necessarily convex) compact set $K\subset R^n$ and an even integer $d$, find an homogeneous polynomial $g$ of degree $d$ such that $K\subset…