Delphi.science

The sharp vertex bound for conditional decomposability

Source: github.com/caiusdfolkerts/research/tree/d56c76be36b7748817a…

Caius Folkerts

Palomar Registrypalomar/PALOMAR-2026-11-19-000010Nov 19, 2026math.COscore 0

For every dimension d at least 3, the least number of vertices of a conditionally Minkowski decomposable convex d-polytope is 4d-4. The formalization proves the universal lower bound, all-dimensional attainment, the literal least-number formulation, and the stronger statement that below this threshold decomposability is determined by the face lattice. Polytopes are actual finite convex hulls with their extreme vertices, and Minkowski summands may have any affine dimension.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-19-000010
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000010/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-11-19-000010/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'