Open Research Index

lennrt/palomar-formalizations

Lennart Rudolph

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

A concrete formalization of the infinite-family construction in the source: cycle and Cartesian-product distances on P_m □ C_(6m), the displayed landmarks (0,0), (0,2m), and (m-1,0), the four-piece cycle distance-pair locus, and injectivity of the resulting unordered multiset code for every even m at least 2. This establishes the three-landmark resolving upper bound. It does not formalize the separate general lower bound needed to conclude that the set is a basis or that the multiset dimension equals 3.

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