Wiki
Wiki

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

Updated


Statement

Setting (p. 11). Let αi=1+(1/2i)\alpha_i=1+(1/2^i), so that (1/αi)+αi+1<2(1/\alpha_i)+\alpha_{i+1}<2 for all i≥1i\ge1. For small ε\varepsilon, let q(ε)q(\varepsilon) be the largest integer such that, for i=1,2,…,q(ε)i=1,2,\ldots,q(\varepsilon), (1/a)+b≤2(1/a)+b\le2 whenever αi−ε≤a≤αi\alpha_i-\varepsilon\le a\le\alpha_i and αi+1−ε≤b≤αi\alpha_{i+1}-\varepsilon\le b\le\alpha_i. The upper bound on bb is printed as αi\alpha_i; read literally it would make q(ε)=0q(\varepsilon)=0, since (1/αi)+αi>2(1/\alpha_i)+\alpha_i>2, and the proof of Theorem 9 applies the remark with b≤αi+1b\le\alpha_{i+1}. The paper notes that q(ε)→∞q(\varepsilon)\to\infty as ε→0+\varepsilon\to0^+.

Theorem 9 (p. 11). Let B={b1<b2<b3<⋯ }B=\{b_1<b_2<b_3<\cdots\} be a set such that for each t>1t>1 there exist integers i,k,si,k,s with

  • (i) bj+1/bj≤αs+tb_{j+1}/b_j\le\alpha_{s+t} for i≤j≤i+ki\le j\le i+k,
  • (ii) bi+k/bi≥∏s+1≤r≤s+tαrb_{i+k}/b_i\ge\prod_{s+1\le r\le s+t}\alpha_r, and
  • (iii) s+t≤q(ε)s+t\le q(\varepsilon), where ε=2max⁡{(bj+1/bj)−1:i≤j≤i+k}\varepsilon=2\max\{(b_{j+1}/b_j)-1:i\le j\le i+k\}.

Then BB has property DW.

Corollary 4 (p. 11). If bi+1/bi→1b_{i+1}/b_i\to1 as i→∞i\to\infty, then BB has property DW. The paper concludes (p. 12) that a sequence of the form an=exp⁡(nε)a_n=\exp(n^{\varepsilon}) has property DW, and remarks that conditions both necessary and sufficient for property DW appear difficult to state.

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 setting, Theorem 9, its proof and Corollary 4 on p. 11, the proof of Corollary 4 and the closing remarks on p. 12.

Read depth. Claims checked: the setting, the theorem and Corollary 4 were read clause by clause on the print's pages. The proofs were read but not checked step by step. Nothing here is independently reviewed.

Proof pointer

Theorem 9, p. 11: starting at bib_i, greedily pick terms ag=bi+n(g)a_g=b_{i+n(g)} with n(g)n(g) the largest index for which the ratio to the previous pick stays at most αs+g\alpha_{s+g}. Condition (i) makes each pick exist while n(g)≤kn(g)\le k, and condition (ii) forces n(t)≤kn(t)\le k, so tt picks fit, while the ratios between picks fall just below αs+1,αs+2,…\alpha_{s+1},\alpha_{s+2},\ldots; the defining property of q(ε)q(\varepsilon) and condition (iii) then give 2aj+1≥aj+aj+22a_{j+1}\ge a_j+a_{j+2}, so the picks form a tt-term descending wave. Corollary 4, p. 12: take s=0s=0 and choose ii and then kk large enough for the three conditions.

Dependencies

None outside the paper.

Bears on

No problem page.