Related papers: Universal minima of discrete potentials for sharp …
We give a sharp lower bound on the capacity of a real stable polynomial, depending only on the value of its gradient at $x = 1$. This result implies a sharp improvement to a similar inequality proved by Linial-Samorodnitsky-Wigderson in…
We improve upper bounds on sphere packing densities and sizes of spherical codes in high dimensions. In particular, we prove that the maximal sphere packing densities $\delta_n$ in $\mathbb{R}^n$ satisfy \[\delta_n\leq \frac{1+o(1)}{e}\cdot…
Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has…
A known general class of superintegrable systems on 2D spaces of constant curvature can be defined by potentials separating in (geodesic) polar coordinates. The radial parts of these potentials correspond either to an isotropic harmonic…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
In this note, we investigate the behaviour of suprema for band-limited spherical random fields. We prove upper and lower bound for the expected values of these suprema, by means of metric entropy arguments and discrete approximations; we…
We estimate explicit lower bounds for the isoperimetric profiles of the Riemannian product of a compact manifold and the Euclidean space with the flat metric, $(M^m\times \mathbb{R}^n,g+g_E)$, $m,n>1$. In particular, we introduce a lower…
We study eigenvalues of polyharmonic operators on compact Riemannian manifolds with boundary (possibly empty). In particular, we prove a universal inequality for the eigenvalues of the polyharmonic operators on compact domains in a…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
We consider the discrete nonlinear Schr{\"o}dinger equations on a one dimensional lattice of mesh h, with a cubic focusing or defocusing nonlinearity. We prove a polynomial bound on the growth of the discrete Sobolev norms, uniformly with…
The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…
We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…
This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon…
We describe a pseudo-Newtonian potential which, to within 1% error at all angular momenta, reproduces the precession due to general relativity of particles whose specific orbital energy is small compared to c^2 in the Schwarzschild metric.…
We identify a universal structural principle underlying the smoothing of classical divergences: the optimizer of the smoothing problem is a clipped probability vector, independently of the specific divergence. This yields a…
In this paper, we provide tight lower bounds for the oracle complexity of minimizing high-order H\"older smooth and uniformly convex functions. Specifically, for a function whose $p^{th}$-order derivatives are H\"older continuous with…
Subject to suitable boundary conditions being imposed, sharp inequalities are obtained on integrals over a region $\Omega$ of certain special quadratic functions $f(\bf{E})$ where $\bf{E}(\bf{x})$ derives from a potential $\bf{U}(\bf{x})$.…
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…
We study a discrete model of repelling particles, and we show using linear programming bounds that many familiar families of error-correcting codes minimize a broad class of potential energies when compared with all other codes of the same…
In this paper, we define natural capacities using a relative volume of graphs over manifolds, which can be characterized by solutions of bounded variation to Dirichlet problems of minimal hypersurface equation. Using the capacities, we…