Related papers: On the Global Optimality of Fibonacci Lattices in …
We study point configurations on the torus $\mathbb T^d$ that minimize interaction energies with tensor product structure which arise naturally in the context of discrepancy theory and quasi-Monte Carlo integration. Permutation sets on…
We utilize recently introduced linear programming bounds for the energy of periodic configurations in $\mathbb{R}^d$ to construct configurations which are universally optimal among those of the form $\omega_4+L_\beta$, where $\omega_4$ is a…
We study the size of the largest rectangle containing no point of a given point set in the two-dimensional torus, the dispersion of the point set. A known lower bound for the dispersion of any point set of cardinality $n\ge 2$ in this…
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…
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…
We investigate quasi-Monte Carlo (QMC) integration of bivariate periodic functions with dominating mixed smoothness of order one. While there exist several QMC constructions which asymptotically yield the optimal rate of convergence of…
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 a generalization of the Bauer maximum principle. We work with tensorial products of convex measures sets, that are non necessarily compact but generated by their extreme points. We show that the maximum of a quasi-convex lower…
Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair…
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 the exponent $4/3$ for the lattice point discrepancy of a torus in $\mathbb{R}^3$ (generated by the rotation of a circle around the $z$ axis). The exponent comes from a diagonal term and it seems a natural limit for any approach…
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…
An efficient algorithm is constructed for contracting two-dimensional tensor networks under periodic boundary conditions. The central ingredient is a novel renormalization step that scales linearly with system size, i.e. from $L \to L+1$.…
We consider the lattice point problem corresponding to a family of elliptic paraboloids in $\mathbb{R}^d$ with $d\ge3$ and we prove the expected to be optimal exponent, improving previous results. This is especially noticeable for $d=3$…
We investigate the attractive Fermi polaron problem in two dimensions using non-perturbative Monte Carlo simulations. We introduce a new Monte Carlo algorithm called the impurity lattice Monte Carlo method. This algorithm samples the path…
The design of minimum-compliance bending-resistant structures with continuous cross-section parameters is a challenging task because of its inherent non-convexity. Our contribution develops a strategy that facilitates computing all…
Techniques involving factorization are found in a wide range of applications and have enjoyed significant empirical success in many fields. However, common to a vast majority of these problems is the significant disadvantage that the…
We study a generalized clock model on the simple cubic lattice. The parameter of the model can be tuned such that the amplitude of the leading correction to scaling vanishes. In the main part of the study we simulate the model with $Z_8$…
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…
The optimal lattice quantizer is the lattice which minimizes the (dimensionless) second moment $G$. In dimensions $1$ to $8$, it has been proven that the optimal lattice quantizer is one of the classical lattices, or there is good evidence…