We prove that the Cohn-Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn- Triantafillou [Math. Comp. 91 (2021), pp. 491 ...
In various robotics applications, the selection of function approximation methods greatly influences the feasibility and computational efficiency of algorithms. Tensor Networks (TNs), also referred to as tensor decomposition techniques, present a versatile ...
We develop a very general version of the hyperbola method which extends the known method by Blomer and Brudern for products of projective spaces to complete smooth split toric varieties. We use it to count Campana points of bounded log-anticanonical height ...
We develop new tools to study landscapes in nonconvex optimization. Given one optimization problem, we pair it with another by smoothly parametrizing the domain. This is either for practical purposes (e.g., to use smooth optimization algorithms with good g ...
The official Spherical Tokamak for Energy Production mission aims to demonstrate the ability to generate net electricity from fusion with the STEP Prototype Power plant. One of the key technological and engineering challenges in fusion power plants is mana ...
The time-honored Allen -Feldman theory of heat transport in glasses is generally assumed to predict a finite value for the thermal conductivity, even if it neglects the anharmonic broadening of vibrational normal modes. We demonstrate that the harmonic app ...
