Related papers: Zeros of Optimal Functions in the Cohn-Elkies Line…

Viazovska proved that the $E_8$ lattice sphere packing is the densest sphere packing in 8 dimensions. Her proof relies on two inequalities between functions defined in terms of modular and quasimodular forms. We give a direct proof of these…

How can we understand the origins of highly symmetrical objects? One way is to characterize them as the solutions of natural optimization problems from discrete geometry or physics. In this paper, we explore how to prove that exceptional…

We prove an optimal bound in twelve dimensions for the uncertainty principle of Bourgain, Clozel, and Kahane. Suppose $f \colon \mathbb{R}^{12} \to \mathbb{R}$ is an integrable function that is not identically zero. Normalize its Fourier…

We identify universal polar dual pairs of spherical codes $C$ and $D$ such that for a large class of potential functions $h$ the minima of the discrete $h$-potential of $C$ on the sphere occur at the points of $D$ and vice versa. Moreover,…

Here we study problems related to the proportions of zeros, especially simple and distinct zeros on the critical line, of Dedekind zeta functions. We obtain new bounds on a counting function that measures the discrepancy of the zeta…

The study of inner and cyclic functions in $\ell^p_A$ spaces requires a better understanding of the zeros of the so-called optimal polynomial approximants. We determine that a point of the complex plane is the zero of an optimal polynomial…

The aim of this note is to provide a full space quadratic external field extension of a classical result of Marcel Riesz for the equilibrium measure on a ball with respect to Riesz s-kernels. We address the case s=d-3 for arbitrary…

In 2016, Viazovska famously solved the sphere packing problem in dimension $8$, using modular forms to construct a 'magic' function satisfying optimality conditions determined by Cohn and Elkies in 2003. In March 2024, Hariharan and…

We develop new solvability methods for divergence form second order, real and complex, elliptic systems above Lipschitz graphs, with $L_2$ boundary data. The coefficients $A$ may depend on all variables, but are assumed to be close to…

We prove an analogue of the Korneichuk--Stechkin lemma for functions with values in $L$-spaces. As applications, we obtain sharp Ostrowski type inequalities and solve problems of optimal recovery of identity and convexifying operators, as…

Motivated by the search for best lattice sphere packings in Euclidean spaces of large dimensions we study randomly generated perfect lattices in moderately large dimensions (up to d=19 included). Perfect lattices are relevant in the…

The Riemann Zeta-Function is the most studied L-function; it's zeroes give information about the prime numbers. We can associate L-functions to a wide array of objects, and in general, the zeroes of these L-functions give information about…

We propose a unified framework that synthesizes advances in high-dimensional lattice theory with novel computational algorithms for the shortest vector problem (SVP) to model pure root lattices and compute sphere packing densities. Building…

In mathematical modelling, the data and solutions are represented as measurable functions and their quality is oftentimes captured by the membership to a certain function space. One of the core questions for an analysis of a model is the…

The Dehn function and its higher-dimensional generalizations measure the difficulty of filling a sphere in a space by a ball. In nonpositively curved spaces, one can construct fillings using geodesics, but fillings become more complicated…

In this paper, we further extend the study of function-correcting codes in the homogeneous metric over a chain ring $\mathbb{Z}_{2^s}$ for broader classes of functions, namely, locally bounded functions and linear functions, and for weight…

Our object of study is extremal functions which are defined by distance functions of convex bodies. These functions take values in the moduli spaces of algebraic and geometric objects associated with these ${\mathbb Z}$-modules (geometric…

The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…

We set up a connection between the theory of spherical designs and the question of minima of Epstein's zeta function. More precisely, we prove that a Euclidean lattice, all layers of which hold a 4-design, achieves a local minimum of 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…