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

Self-gravitating horizonless ultra-compact objects that possess light rings have attracted the attention of physicists and mathematicians in recent years. In the present compact paper we raise the following physically interesting question:…

We consider the averages of a function $ f$ on $ \mathbb R ^{n}$ over spheres of radius $ 0< r< \infty $ given by $ A_{r} f (x) = \int_{\mathbb S ^{n-1}} f (x-r y) \; d \sigma (y)$, where $ \sigma $ is the normalized rotation invariant…

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…

We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…

Let $k$ be a field of characteristic $0$ and let $K = k(B)$ be the function field of a geometrically irreducible projective curve $B$ over $k$. Let $A/K$ be a $g$-dimensional abelian variety with $\mathrm{Tr}_{K/k}(A) = 0$. We prove that…

We provide upper and lower bounds on the lowest free energy of a classical system at given one-particle density $\rho(x)$. We study both the canonical and grand-canonical cases, assuming the particles interact with a pair potential which…

Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…

Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6). We use semidefinite programming bounds instead to show…

We explicitly bound T-singularities on normal projective surfaces $W$ with one singularity, and $K_W$ ample. This bound depends only on $K_W^2$, and it is optimal when $W$ is not rational. We classify and realize surfaces attaining the…

In this work, the notions of normal cones at infinity to unbounded sets and limiting and singular subdifferentials at infinity for extended real value functions are introduced. Various calculus rules for these notions objects are…

We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…

We obtain boundedness for the bilinear spherical maximal function in a range of exponents that includes the Banach triangle and a range of $L^p$ with $p<1$. We also obtain counterexamples that are asymptotically optimal with our positive…

Let $M$ be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that $M$ is globally maximum if it is a maximum-length matching on all points. We say that $M$ is $k$-local maximum…

This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…

In this article we present a unified treatment for obtaining bounds on the potential energy of codes in the general context of polynomial metric spaces (PM-spaces). The lower bounds we derive via the linear programming (LP) techniques of…

Based on fundamental properties of light scattering by a particle we reveal the existence of the ultimate upper limit for the light absorption by any partial mode. First, we obtain this result for scattering of a plane wave by a symmetric…

In this paper, we give a conditional lower bound of $n^{\Omega(k)}$ on running time for the classic k-median and k-means clustering objectives (where n is the size of the input), even in low-dimensional Euclidean space of dimension four,…

In this paper we study the eigenvalues of buckling problem on domains in a unit sphere. By introducing a new parameter and using Cauchy inequality, we optimize the inequality obtained by Wang and Xia in [12].

As explained in detail in the prologue to this manuscript, boundedness of weak solutions for general classes of elliptic equations in divergence form is a classic tool for achieving higher regularity. We propose here some global boundedness…

We investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint…