Matching works

1 work

math.NT — Number Theory

Algorithms for computing iso-Delaunay domains

Contributed by Mathieu Dutour Sikiric

For a linear space TT of quadratic forms, we describe an algorithm enumerating the iso-Delaunay domains of TT, and a randomized search for an iso-Delaunay domain all of whose extreme rays are positive definite. For the quadratic forms in six variables, the search finds 14721472 pairwise inequivalent LL-type domains all of whose extreme rays are positive definite, the smallest having 2424 facets and 4747 extreme rays. No such domain exists in dimension 2≤n≤52\leq n\leq 5.

Author comments: 17 pages. The algorithms are implemented in polyhedral_common, https://github.com/MathieuDutSik/polyhedral_common. The data of the 1472 domains are at https://doi.org/10.5281/zenodo.24377749

A mix of human-written and AI-generated textHuman understanding: all partsDelaunay tessellationsL-typesVoronoi reduction theoryiso-Delaunay domainsquadratic forms
Nov 20, 202617 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations