Open Research Index

Selected Sidon subset theorems of Ma–Tang (partial paper formalization)

AItoBit

Palomar Registrypalomar/PALOMAR-2026-10-21-000023Oct 21, 2026math.COscore 0

Lean 4 proofs of the exact largest-Sidon-subset guarantee g(n)=ceil((n+1)/2) for finite weak Sidon sets, its asymptotic density 1/2, convergence and the optimal-constant characterization for finite (4,5)-sets, and the upper bound cStar<=4/7. The project also proves the finite three-uniform transversal bound 4tau<=n+m used in the exact guarantee. This is a partial formalization of Ma–Tang, arXiv:2602.23282v2: Theorem5.3 and the lower9/17 bound in Theorem1.6 remain unproved.

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