相关论文: A Family of Universally Optimal Configurations on …
We develop lower bounds for the energy of configurations in $\mathbb{R}^d$ periodic with respect to a lattice. In certain cases, the construction of sharp bounds can be formulated as a finite dimensional, multivariate polynomial…
We use linear programming bounds to analyze point sets in the torus with respect to their optimality for problems in discrepancy theory and quasi-Monte Carlo methods. These concepts will be unified by introducing tensor product energies. We…
We enumerate and classify all stationary logarithmic configurations of d+2 points on the unit (d-1)-sphere in d-dimensions. In particular, we show that the logarithmic energy attains its relative minima at configurations that consist of two…
The search for optimal configurations of pointsets, the most notable examples being the problems of Kepler and Thompson, have an extremely rich history with diverse applications in physics, chemistry, communication theory, and scientific…
We present two families of lattice theta functions accompanying the family of lattice theta functions studied by Montgomery in [H.~Montgomery. Minimal theta functions. \textit{Glasgow Mathematical Journal}, 30(1):75--85, 1988]. The studied…
Proving the universal optimality of the hexagonal lattice is one of the big open challenges of nowadays mathematics. We show that the hexagonal lattice outperforms certain "natural" classes of periodic configurations. Also, we rule out the…
We consider pairwise interaction energies and we investigate their minimizers among lattices with prescribed minimal vectors (length and coordination number), i.e. the one corresponding to the crystal's bonds. In particular, we show the…
We consider the minimizing problem for energy functionals with two types of competing particles and completely monotone potential on a lattice. We prove that the minima of sum of two completely monotone functions among lattices is located…
We prove that the $E_8$ root lattice and the Leech lattice are universally optimal among point configurations in Euclidean spaces of dimensions $8$ and $24$, respectively. In other words, they minimize energy for every potential function…
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…
We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…
We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…
It is well-known that any Lennard-Jones type potential energy must have a periodic ground state given by a triangular lattice in dimension 2. In this paper, we describe a computer-assisted method that rigorously shows such global minimality…
Based on the Delsarte-Yudin linear programming approach, we extend Levenshtein's framework to obtain lower bounds for the minimum $h$-energy of spherical codes of prescribed dimension and cardinality, and upper bounds on the maximal…
In the Sobolev space $L_2^{(m)}(0,1)$ optimal quadrature formulas with the nodes (1.5) are investigated. For optimal coefficients explicit form are obtained and norm of the error functional is calculated. In particular, by choosing…
Universal bounds for the potential energy of weighted spherical codes are obtained by linear programming. The universality is in the sense of Cohn-Kumar -- every attaining code is optimal with respect to a large class of potential functions…
We consider the following eigenvalue optimization in the composite membrane problem with fractional Laplacian: given a bounded domain $\Omega\subset \mathbb{R}^n$, $\alpha>0$ and $0<A<|\Omega|$, find a subset $D\subset \Omega$ of area $A$…
Let $\Omega \subset \mathbb{R}^N$ be an open set. In this work we consider solutions of the following gradient elliptic system \[ -\text{div}(A(x)\nabla u_{i,\beta}) = f_i(x,u_{i,\beta}) + a(x)\beta |u_{i, \beta}|^{\gamma -1}u_{i, \beta}…
We propose a method for verifying that a given feasible point for a polynomial optimization problem is globally optimal. The approach relies on the Lasserre hierarchy and the result of Lasserre regarding the importance of the convexity of…
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…