Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Theorem 7 (p. 9). Let be the length of the longest descending wave in the sequence , where . Then there exist constants and such that
The statement places no restriction on . The proof's lower bound is given for , where it takes , and its upper-bound argument ends by saying that the length is less than, approximately, twice (p. 10).
Source. Brown, T. C., Erdős, P. and Freedman, A. R., Quasi-progressions and descending waves, J. Combin. Theory Ser. A 53 (1990), no. 1, 81--95, doi:10.1016/0097-3165(90)90021-N, read in the authors' copy identified on the source card, whose pages are numbered 1 to 13: the statement on p. 9, the proof on pp. 9--10.
Read depth. Claims checked: the statement was read clause by clause on the print's page. The proof was read but not checked step by step; as noted above, its upper bound is argued only approximately in the print. Nothing here is independently reviewed.
Proof pointer
Section 4, pp. 9--10. Lower bound: the terms form a descending wave exactly when , which allows of order . Upper bound: in a descending wave the exponent gaps cannot increase, and once the ratio of consecutive terms is close to 1 the exponent gaps are bounded by about , so the wave has length about at most .
Dependencies
None outside the paper.
Bears on
No problem page.