Delphi.science

Erdős Problem 881 for k = 2: infinite deletions from asymptotic bases of order two

Source: github.com/BruceLoveLee000/erdos-lean-proofs/tree/caacb3967…

Bruce Lee

Palomar Registrypalomar/PALOMAR-2026-11-09-000017Nov 9, 2026math.NTscore 0

Erdős Problem 881 asks whether every minimal additive basis A of order k (one from which no infinite set can be removed while keeping a basis of order k) contains an infinite set B such that A \ B is a basis of order k + 1. This formalization settles the case k = 2 in the formulation of google-deepmind/formal-conjectures, where a basis of order n is an asymptotic basis: all but finitely many natural numbers are sums of exactly n elements of A. It proves the stronger statement that every asymptotic additive basis of order 2 in the natural numbers, minimal or not, contains an infinite set…

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