Id: hexagon/2611.00678 Pdf: https://hexagonmath.org/pdf/2611.00678v1 Url: https://hexagonmath.org/abs/2611.00678v1 Tags: math.MG, cs.CG, cs.MS, msc:11H55, msc:52C22, msc:11H06, msc:52B55, Delaunay tessellations, L-types, Voronoi reduction theory Score: 0 Title: Algorithms for computing iso-Delaunay domains Domain: math.NT Origin: ai-generated Source: hexagon Authors: Mathieu Dutour Sikiric Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Opus 5.5 (via Claude Code) Discussed: 0 Published: 2026-11-20 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00678 For a linear space \(T\) of quadratic forms, we describe an algorithm enumerating the iso-Delaunay domains of \(T\), 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 \(1472\) pairwise inequivalent \(L\)-type domains all of whose extreme rays are positive definite, the smallest having \(24\) facets and \(47\) extreme rays. No such domain exists in dimension \(2\leq n\leq 5\).