Related papers: Bounds on Discrete Potentials of Spherical (k,k)-D…

We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…

In this paper we slightly improve the regularity theory for the so called optimal design problem. We first establish the uniform rectifiability of the boundary of the optimal set, for a larger class of minimizers, in any dimension. As an…

We identify universal polar dual pairs of spherical codes $C$ and $D$ such that for a large class of potential functions $h$ the minima of the discrete $h$-potential of $C$ on the sphere occur at the points of $D$ and vice versa. Moreover,…

We introduce a new type of $n$-dimensional generalization of symmetric $(v,k,\lambda)$ block designs. We prove upper bounds on the dimension $n$ in terms of $v$ and $k$. We also define the corresponding concept of $n$-dimensional difference…

A topological constraint on the possible values of the universal quantization parameter is revealed in the case of geometric quantization on (boundary) curves diffeomorphic to $S^1$, analytically extended on a bounded domain in…

We develop a formalism, based on spinor-helicity techniques, to generalize the formulation of partial wave unitarity bounds. We discuss unitarity bounds for $N \to M$ (with $N,M \geq 2$) scattering processes -- relevant for high-energy…

In this article, we study shape fitting problems, $\epsilon$-coresets, and total sensitivity. We focus on the $(j,k)$-projective clustering problems, including $k$-median/$k$-means, $k$-line clustering, $j$-subspace approximation, and the…

A permutation $\sigma\in S_n$ is said to be $k$-universal or a $k$-superpattern if for every $\pi\in S_k$, there is a subsequence of $\sigma$ that is order-isomorphic to $\pi$. A simple counting argument shows that $\sigma$ can be a…

We use the Hardy spaces for Fourier integral operators to obtain bounds for spherical maximal functions in $L^{p}(\mathbb{R}^{n})$, $n\geq2$, where the radii of the spheres are restricted to a compact interval in $(0,\infty)$. These bounds…

We study the problem of maximizing the minimal value over the sphere $S^{d-1}\subset \mathbb R^d$ of the potential generated by a configuration of $d+1$ points on $S^{d-1}$ (the maximal discrete polarization problem). The points interact…

We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…

We consider the problem of finding an $N$-point configuration on the sphere $S^d\subset \RR^{d+1}$ with the smallest absolute maximum value over $S^d$ of its total potential. The potential induced by each point ${\bf y}$ in a given…

In this work we deal with a following nonlinear Schrodinger equation in dimension greater or equal to 3, with a subcritical power-type nonlinearity and a positive potential satisfying a local condition. We prove the existence and…

We present a new proof (based on spectral decomposition) of a bound originally proved by Sidelnikov~\, for the frame potentials $\sum_{ij} \left( {\bf P}_i \cdot {\bf P}_j \right)^\ell $ on a unit--sphere in $d$ dimensions. Sidelnikov's…

An optimal control problem associated with the dynamics of the orientation of a bipolar molecule in the plane can be understood by means of tools in differential geometry. For first time in the literature $k$-symplectic formalism is used to…

In recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices $V$, we want to find a subset of vertices $S$, called centers, such that the maximum cluster radius is minimized. Moreover,…

Recently, Theophilou (J. Chem.Phys {\bf 149} 074104 (2018)) showed that a set of spherically symmetric densities determines uniquely the external potential in molecules and solids. Here, spherically symmetric Kohn-Sham-like equations are…

We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points ("guards") that are "universal" in their ability to guard any of a set of possible polygonal domains in the plane. We give…

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…