Delphi.science

Cyclic four-point square fibres and fixed membership reconstruction

Source: github.com/alexcour/couret-finite-verifications/tree/a35621…

Alexandre Couret

Palomar Registrypalomar/PALOMAR-2026-11-14-000023Nov 14, 2026math.COscore 0

For a four-point support in Z/nZ with n positive, the complete labelled ordered-square fibre has cardinality one, two or four. At most two fixed binary membership probes separate that fibre. The full square and its fibre are supplied; no computational runtime bound or adaptive query lower bound is asserted.

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