Let $S_k$ be the set of positive integers containing no arithmetic progression of $k$ terms, generated by the greedy algorithm. A heuristic formula, supported by ...
Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. In 2017, P. M. Berná ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback