Erdős Problem 338: restricted order of robust sets of positive lower density
Source: github.com/veljjanoski/erdos338-palomar/tree/a699263d0f7cdc…
If A \ F is a basis for every finite set F and A has positive lower density, then A has a restricted order: every sufficiently large integer is a sum of a bounded number of distinct elements of A. This is a partial result on Erdős Problem 338 (Erdős and Graham ask whether every such A, without the density condition, has a restricted order). The proof counts pairs to show that, for every R, the numbers with at least R representations as a sum of two distinct elements of A have positive lower density, uniformly in R; uses Kneser's theorem for finite abelian groups to write all large numbers of…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-03-000016
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-03-000016/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-03-000016/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'