Related papers: Universal lower bounds for potential energy of sph…
We consider a binary system of small and large spheres of finite size in a continuous medium interacting via a non-negative potential. We work in the canonical ensemble and compute upper and lower bound for the free energy at finite and…
We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…
In this paper, we use the linear programming approach to find new upper bounds for the moments of isotropic measures. These bounds are then utilized for finding lower packing bounds and energy bounds for projective codes. We also show that…
Polynomial, or Delsarte's, method in coding theory accounts for a variety of structural results on, and bounds on the size of, extremal configurations (codes and designs) in various metric spaces. In recent works of the authors the…
Energy bounds which are uniform in the background metric are obtained from upper bounds for entropy-like quantities. The argument is based on auxiliary Monge-Amp\`ere equations involving sublevel sets, and bypasses the…
We study configurations of points on the unit sphere that minimize potential energy for a broad class of potential functions (viewed as functions of the squared Euclidean distance between points). Call a configuration sharp if there are m…
We present a branch-and-bound algorithm to improve the lower bounds obtained by SONC/SAGE. The running time is fixed-parameter tractable in the number of variables. Furthermore, we describe a new heuristic to obtain a candidate for the…
We prove a uniform upper and lower bound for Delannoy numbers. This is achieved by using the representation of Delannoy numbers as the number of lattice points in high-dimensional cross-polytopes (also known as hyper-octahedrons or $\ell^1$…
We consider the coding problem in the Stiefel manifold with chordal distance. After considering various low-dimensional instances of this problem, we use Rankin's bounds on spherical codes to prove upper bounds on the minimum distance of a…
Previous studies have used numerical methods to optimize the hyperpolarizability of a one-dimensional quantum system. These studies were used to suggest properties of one-dimensional organic molecules, such as the degree of modulation of…
In this paper we explore the connections between minimizers of the discrete logarithmic energy on the 2-dimensional sphere, univariate polynomials with optimal condition number in the Shub-Smale sense and a quotient involving norms of…
The development of computational resources has made it possible to determine upper bounds for atomic and molecular energies with high precision. Yet, error bounds to the computed energies have been available only as estimates. In this…
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…
From minimal surfaces such as Simons' cone and catenoids, using refined Lyapunov-Schmidt reduction method, we construct new solutions for a free boundary problem whose free boundary has two components. In dimension $8$, using variational…
We consider the problem of finding the shortest possible period for an exactly periodic solution to some given autonomous ordinary differential equation. We show that, given a pair of Lyapunov-like observable functions defined over the…
We present some upper bounds on the size of non-linear codes and their restriction to systematic codes and linear codes. These bounds are independent of other known theoretical bounds, e.g. the Griesmer bound, the Johnson bound or the…
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…
We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…
We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…
In this article we provide an experimental algorithm that in many cases gives us an upper bound of the global infimum of a real polynomial on $\R^{n}$. It is very well known that to find the global infimum of a real polynomial on $\R^{n}$,…