English

On the Global Optimality of Fibonacci Lattices in the Torus

Numerical Analysis 2025-10-28 v2 Numerical Analysis Combinatorics Metric Geometry Optimization and Control

Abstract

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 show that the canonical 33-point lattice in any dimension is globally optimal among all 33-point sets in the torus with respect to a large class of such energies. This is a new instance of universal optimality, a special phenomenon that is only known for a small class of highly structured point sets. In the case of d=2d=2 dimensions it is conjectured that so-called Fibonacci lattices should also be optimal with respect to a large class of potentials. To this end we show that the 55-point Fibonacci lattice is globally optimal for a continuously parametrized class of potentials relevant to the analysis fo the quasi-Monte Carlo method.

Keywords

Cite

@article{arxiv.2502.17082,
  title  = {On the Global Optimality of Fibonacci Lattices in the Torus},
  author = {Nicolas Nagel},
  journal= {arXiv preprint arXiv:2502.17082},
  year   = {2025}
}

Comments

Major revision for version 2