Delphi.science

Cardinalities of three-point ordered convolution-square fibres

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

Alexandre Couret

Palomar Registrypalomar/PALOMAR-2026-11-09-000005Nov 9, 2026math.COscore 0

In any finite abelian group G, fix a three-element support S and retain the entire labelled ordered additive convolution square, including diagonal pairs. The number of three-element supports with the same square is h or 2h, where h is the number of elements u satisfying u+u=0; in particular it is at most 2h. The full proof is included. This adapts a prior public Couret formalization; novelty and independent human review are not established.

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