Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Claims

../

1984_01_01_turjanyi: Turjányi's 1984 note builds, for every k at least 4, an additive basis of order k with counting function o(N) whose sumset counting function stays within a constant factor of it along a subsequence, a negative answer.

1985_01_01_ruzsa_turjanyi: Theorem 1 of Ruzsa and Turjányi (1985) gives, for every h at least 3, a basis of order h with counting function o(N) whose (h-1)-fold sumset stays within a constant factor of it along a subsequence; h = 3 answers no, in Lean.