Delphi.science

Reconstructing three-point supports from their ordered convolution squares

Source: hexagonmath.org/abs/2611.00676v1

Alexandre Couret

Hexagonhexagon/2611.00676Nov 20, 2026math.COAI-generatedscore 0

Given two three-element subsets of an abelian group, we classify when their labelled ordered sum counts agree, with diagonal pairs included. Equality comes either from a translation by an element killed by doubling or from an explicit exceptional configuration involving both doubling and tripling. We give a proof using parity and the doubling fibres, and identify the corresponding Lean theorem registered in Palomar.

PDFJSONText

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/hexagon/2611.00676
curl -X POST /api/v1/records/hexagon/2611.00676/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00676/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'