Related papers: Universal lower bounds for potential energy of sph…
In this note we examine the a priori and a posteriori analysis of discontinuous Galerkin finite element discretisations of semilinear elliptic PDEs with polynomial nonlinearity. We show that optimal a priori error bounds in the energy norm…
We describe a framework for bounding extreme values of quantities on global attractors of differential dynamical systems. A global attractor is the minimal set that attracts all bounded sets; it contains all forward-time limit points. Our…
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 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…
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 solve an energy minimization problem for local fields. As an application of these results, we improve on lower bounds set by Bombieri and Zannier for the limit infimum of the Weil height in fields of totally p-adic numbers and…
We develop a new, unified approach to the following two classical questions on elliptic PDE: the strong maximum principle for equations with non-Lipschitz nonlinearities, and the at most exponential decay of solutions in the whole space or…
Distributing points on a (possibly high-dimensional) sphere with minimal energy is a long-standing problem in and outside the field of mathematics. This paper considers a novel energy function that arises naturally from statistics and…
We present a generalization of a family of points on $\mathbb{S}^2$, the Diamond ensemble, containing collections of $N$ points on $\mathbb{S}^2$ with very small logarithmic energy for all $N\in\mathbb{N}$. We extend this construction to…
We obtain an upper bound for the multiplicative energy of the spectrum of an arbitrary set from $\mathbb{F}_p$, which is the best possible up to the results on exponential sums over subgroups.
We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…
We give results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper, and suggests a version of a…
This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\!(n, K, {\delta})\!)_2$…
We investigate the nonlocal energy corresponding to the $p$-oscillation of the unit normal vector for hypersurfaces, or the unit tangent vector for curves. The energy satisfies geometric inequalities with optimal constants $c(n,p)$ and…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
Motivated by the recent article of P. Shea {\it et al.} [Am. J. Phys. {\bf 77} (6), 2009] we examine the exactly solvable problem of two harmonically trapped ultra-cold bosonic atoms interacting {\it via} a short range potential in one and…
We draw a new connection between Coppersmith's method for finding small solutions to polynomial congruences modulo integers and the capacity theory of adelic subsets of algebraic curves. Coppersmith's method uses lattice basis reduction to…
It is well known that derivatives of solutions to elliptic boundary value problems may become unbounded near the corner of a domain with a conical singularity, even if the data are smooth. When the corner domain is approximated by more…
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…