Even-order Grünschloß–Keller permutation nets: net property and tiling distance
This Lean development proves that the even-order permutation construction of Grünschloß and Keller (MCQMC 2008 proceedings, implemented in gendiag0m2.h) is a base-2 (0,m,2)-net for every even m >= 4. The proof is symbolic: for every resolution a it proves, for every even m >= 8, that one explicit pair of points has squared distance 241 * 2^(m-8), and at m = 8 that 241 is the exact minimum over all pairs and all lattice translates. The exhaustive m = 8 lower bound is reduced by ordinary kernel decide; the exactness of the computed candidate minimum over the whole lattice is a symbolic lemma.…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-09-04-000001
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-04-000001/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-04-000001/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'