On a Problem of Erdös and Szekeres
Canadian mathematical bulletin, Tome 4 (1961) no. 1, pp. 7-12
Voir la notice de l'article provenant de la source Cambridge
Write 1 2 where the maximum is over all real θ, and the lower bound is over all sets of positive integers a1 ≤ a2 ≤ ... ≤ an. The problem of the order of magnitude of f(n) was posed by Erdös and Szekeres [1], side by side with a number of other interesting questions. Writing g(n) = log f(n), it is obvious that g(n) is sub-additive, in the sense that g(m+n) ≤ g(m) + g(n), and also that g(1) = log 2, so that g(n) ≤ n log 2.
Atkinson, F. V. On a Problem of Erdös and Szekeres. Canadian mathematical bulletin, Tome 4 (1961) no. 1, pp. 7-12. doi: 10.4153/CMB-1961-002-5
@article{10_4153_CMB_1961_002_5,
author = {Atkinson, F. V.},
title = {On a {Problem} of {Erd\"os} and {Szekeres}},
journal = {Canadian mathematical bulletin},
pages = {7--12},
year = {1961},
volume = {4},
number = {1},
doi = {10.4153/CMB-1961-002-5},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1961-002-5/}
}
Cité par Sources :