Open Research Index

Erdos 662: corrected global threshold conjecture

Colin Snyder, AItoBit

Palomar Registrypalomar/PALOMAR-2026-10-17-000002Oct 17, 2026math.MGscore 0

Disproves an explicitly corrected global threshold formulation of Erdos problem 662. For each radius, the conjecture bounds the average number of nearby points in every sufficiently large one-separated planar set by the unit triangular lattice's neighbor count. An exact rational oblique lattice and separated finite replicas violate the bound at radius six.

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