Delphi.science

Sharp bounds for indecomposable graphical-zonotope summands: main

Source: github.com/caiusdfolkerts/research/tree/2505d4b11cf6f2c7d34…

Caius Folkerts

Palomar Registrypalomar/PALOMAR-2026-11-20-000007Nov 20, 2026math.COscore 0

Principal path construction and simultaneous sharp bounds; exact 3-tree, clique-book, multipartite and lattice classifications. It also constructs, for every n ≥ 10, K5-free graphs of treewidth four with 3n − 5 edges supporting full-dimensional lattice indecomposable polytopal summands; no proper edge-subgraph supports a full-dimensional indecomposable polytopal weak summand.

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