Related papers: Min-Max Polarization for Certain Classes of Sharp …

We start by providing a very simple and elementary new proof of the classical bound due to J. Beck which states that the spherical cap $\mathbb{L}_2$-discrepancy of any $N$ points on the unit sphere $\mathbb S^d$ in $\mathbb{R}^{d+1}$,…

This paper is devoted to spherical measures and point configurations optimizing three-point energies. Our main goal is to extend the classic optimization problems based on pairs of distances between points to the context of three-point…

Let $d \in \mathbb{N}$, $\delta \in (0, 1/2)$, and $X > 0$. Denote by $N_d(X, \delta)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $\mathbb{R}^d$ such that every pairwise distance is at least…

We develop lower bounds for the energy of configurations in $\mathbb{R}^d$ periodic with respect to a lattice. In certain cases, the construction of sharp bounds can be formulated as a finite dimensional, multivariate polynomial…

We complete the study concerning the minimization of the positive principal eigenvalue associated with a weighted Neumann problem settled in a bounded regular domain $\Omega\subset \mathbb{R}^{N}$, $N\ge2$, for the weight varying in a…

We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…

We study the query complexity of min-max optimization of a nonconvex-nonconcave function $f$ over $[0,1]^d \times [0,1]^d$. We show that, given oracle access to $f$ and to its gradient $\nabla f$, any algorithm that finds an…

We prove that for any compact set B in R^d and for any epsilon >0 there is a finite subset X of B of |X|=d^{O(1/epsilon^2)} points such that the maximum absolute value of any linear function ell: R^d --> R on X approximates the maximum…

In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…

For each $n\geq 3$ we establish the existence of a nodal solution $u$ to the Yamabe problem on the round sphere $(\mathbb{S}^n,g)$ which satisfies $$\int_{\mathbb{S}^n}|u|^{2^*}dV_g < 2m_n\mathrm{vol}(\mathbb{S}^n),$$ where $m_3=9,$ $m_4=…

Let $A$ be a compact $d$-rectifiable set embedded in Euclidean space $\RR^p$, $d\le p$. For a given continuous distribution $\sigma(x)$ with respect to $d$-dimensional Hausdorff measure on $A$, our earlier results provided a method for…

Let $A_tf(x)=\int f(x+ty)d\sigma(y)$ denote the spherical means in $\Bbb R^d$ ($d\sigma$ is surface measure on $S^{d-1}$, normalized to $1$). We prove sharp estimates for the maximal function $M_E f(x)=\sup_{t\in E}|A_tf(x)|$ where $E$ is a…

Smooth convex minimization over the unit trace-norm ball is an important optimization problem in machine learning, signal processing, statistics and other fields, that underlies many tasks in which one wishes to recover a low-rank matrix…

A finite subset $X$ on the unit sphere $\mathbb{S}^{d-1}$ is called an $s$-distance set with strength $t$ if its angle set $A(X):=\{\langle \mathbf{x},\mathbf{y}\rangle : \mathbf{x},\mathbf{y}\in X,\mathbf{x}\neq\mathbf{y} \}$ has size $s$,…

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…

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…

Given $N$ geodesic caps on the unit sphere in $\mathbb{R}^d$, and whose total normalized surface area sums to one, what is the maximal surface area their union can cover? In this work, we provide an asymptotically sharp upper bound for an…

We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…

We establish upper and lower universal bounds for potentials of weighted designs on the sphere $\mathbb{S}^{n-1}$ that depend only on quadrature nodes and weights derived from the design structure. Our bounds hold for a large class of…

Pathfinding in Euclidean space is a common problem faced in robotics and computer games. For long-distance navigation on the surface of the earth or in outer space however, approximating the geometry as Euclidean can be insufficient for…