Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_04_24_turturean: For every k at least 3 and every C > 0 there is an additive basis of order k, in the at-most-k sense, with at least C log n representations of each large n and no minimal subbasis of order k; the question is answered no.
Linked from (1)
Graph