Related papers: Universal minima of discrete potentials for sharp …

An efficient integral equation based solver is constructed for the electrostatic problem on domains with cuboidal inclusions. It can be used to compute the polarizability of a dielectric cube in a dielectric background medium at virtually…

We prove that $poly(t) \cdot n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on a $D$-dimensional lattice with n qudits are approximate $t$-designs in various measures. These include the "monomial"…

The eigenvalue bounds obtained earlier [J. Phys. A: Math. Gen. 31 (1998) 963] for smooth transformations of the form V(x) = g(x^2) + f(1/x^2) are extended to N-dimensions. In particular a simple formula is derived which bounds the…

We estimate optimal thresholds for surface code in the presence of loss via an analytical method developed in statistical physics. The optimal threshold for the surface code is closely related to a special critical point in a…

We consider perturbations of Hamiltonians whose Fourier symbol attains its minimum along a hypersurface. Such operators arise in several domains, like spintronics, theory of supercondictivity, or theory of superfluidity. Variational…

We obtain universal bounds on the energy of codes and for designs in Hamming spaces. Our bounds hold for a large class of potential functions, allow unified treatment, and can be viewed as a generalization of the Levenshtein bounds for…

This is the first part of a series of two papers where we study perturbations of divergence form second order elliptic operators $-\mathop{\operatorname{div}} A \nabla$ by first and zero order terms, whose coefficients lie in critical…

In this paper, maximum principles for Euclidean and hyperbolic discrete conformal structures on polyhedral surfaces are established. These maximum principles unify and generalize the maximum principles for vertex scalings and different…

In this paper we derive estimates for linear potentials that hold away from thin subsets. And, inspired by the celebrated work of Huber, we verify that, for a subset that is thin at a point, there is always a geodesic that reaches to the…

The paper concerns the uniform polynomial approximation of a function $f$, continuous on the unit Euclidean sphere of ${\mathbb R}^3$ and known only at a finite number of points that are somehow uniformly distributed on the sphere. First we…

A family of classical integrable systems defined on a deformation of the two-dimensional sphere, hyperbolic and (anti-)de Sitter spaces is constructed through Hamiltonians defined on the non-standard quantum deformation of a sl(2) Poisson…

We consider the problem of finding the minimum of inhomogeneous Gaussian lattice sums: Given a lattice $L \subseteq \mathbb{R}^n$ and a positive constant $\alpha$, the goal is to find the minimizers of $\sum_{x \in L} e^{-\alpha \|x -…

We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the pre-factor can be significantly improved from the order of…

We provide a polynomial lower bound on the minimum singular value of an $m\times m$ random matrix $M$ with jointly Gaussian entries, under a polynomial bound on the matrix norm and a global small-ball probability bound $$\inf_{x,y\in…

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)…

We prove that the supremum of principal curvatures of a minimal embedded disc in hyperbolic three-space spanning a quasicircle in the boundary at infinity is estimated in a sublinear way by the norm of the quasicircle in the sense of…

Yudin's lower bound for the spherical designs is generalized to the cubature formulas on the projective spaces over a field K, where K can be R, C, or H (the field of quaternions), and thus to isometric embeddings of l_2 into l_p with p an…

We investigate the uniform approximation provided by least squares polynomials on the unit Euclidean sphere $\mathbb{S}^q$ in $\mathbb{R}^{q+1}$, with $q\ge 2$. Like any other polynomial projection, the study concerns the growth, as the…

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the…