Reflexive Descent to Minimal Seeds in the Kreuzer--Skarke List
Kreuzer and Skarke built the list of reflexive polytopes by growing it from small seed polytopes. We ask how far a polytope can be from its seeds when it is shrunk through reflexive polytopes only, one at a time and without skipping any. Such a descent always exists and always ends at a seed. In four dimensions no descent takes more than 348 steps, which proves the conjecture of a uniform transition depth, and in two and three dimensions the exact maxima are five and eleven. In four dimensions two polytopes with thirty-seven lattice points need exactly twenty-two steps, so the maximum lies…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00456
curl -X POST /api/v1/records/hexagon/2610.00456/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00456/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'