Algorithms for computing iso-Delaunay domains
Source: hexagonmath.org/abs/2611.00678v1
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\).
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00678
curl -X POST /api/v1/records/hexagon/2611.00678/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00678/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'