Open Research Index

lennrt/palomar-formalizations

Lennart Rudolph

Palomar Registrypalomar/PALOMAR-2026-08-21-000007Sep 3, 2026math.COscore 0

A Lean formalization of the paper's standard finite-word semantics for k-uniform two-word π-representability, its neighbourhood-trace bound binomial(k(|A|+1),k)^2, the explicit 20-by-741322 bit-incidence graph B20, and the theorem that B20 is not representable by two 2-uniform words. It also retains the companion's token-order bridge and exact arithmetic endpoints.

SourceRepositoryJSON

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