Searcharxiv⌕ Search

arXiv · 2609.35027

The complexity of computing the covering radius of a Euclidean lattice

Abstract

In this note, we prove that the covering radius problem for Euclidean lattices is complete for the second level of the polynomial hierarchy. The note also documents the author's first experiment with generative AI as a tool for mathematical research.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frank Vallentin. 2026-09-28. The complexity of computing the covering radius of a Euclidean lattice. https://arxiv.org/abs/2609.35027

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Metric foundations of geometry

A metric space is called all-set-homogeneous if every isometry between two of its subsets extends to an isometry of the whole space. We classify all-set-homogeneous geodesic spaces: besides the classical examples, they include the universal metric trees of finite valence. We also prove that every complete all-set-homogeneous length space is geodesic, and hence the same classification holds in this setting.

math.MG↗

Divide and Conquer: A Distributed Approach to Five Point Energy Minimization

This work rigorously verifies the phase transition in 5-point energy minimization first observed by Melnyk-Knop-Smith in 1977. More precisely, we prove that there is a constant S = [15+24/512,15+25/512] such that the triangular bi-pyramid is the energy minimizer with respect to the s-power law potential for all s in (0,S) and some pyramid with square base is the unique minimizer for all s in (S,15+512/25]. Taking s=1 gives another solution to Thomson's 5 electron problem from 1904.

math.MG↗

Quadri-Figures in Cayley-Klein Planes II: The Miquel-Steiner Theorem

The Miquel-Steiner theorem for a quadrilateral in the euclidean plane states that the circumcircles of the four component triangles intersect at a single point, which now is called the Miquel-Steiner point of the quadrilateral. The Miquel-Steiner theorem for euclidean planes needs to be slightly modified for Minkowski and galilean planes: Either the circumcircles of the four component triangles touch each other at an isotropic point, or they intersect transversally at an anisotropic point. In elliptic and hyperbolic planes, as well as in dual euclidean and dual Minkowski planes, Miquel-Steiner's theorem does not hold in this form. Instead, a weaker version applies: The circumcircles of the four component triangles of a quadrilateral have a common radical center, which we will also call the Miquel-Steiner point. For specific quadrilaterals (such as cyclic quadrilaterals), the location of the Miquel-Steiner point can be determined more precisely.

math.MG↗