Arithmetic Progressions in a Random Binary Subset-Sum Set
Let $u=(u_n)_{n\ge0}$ be a binary sequence, and define \[ X_0=1,\qquad X_{n+1}=2X_n+u_n \qquad(n\ge0). \] Let $A_u$ be the set of all nonempty finite subset sums of the sequence $(X_n)$, and let $L_u(N)$ denote the maximum length of an arithmetic progression contained in $A_u\cap[1,N]$. We prove that there are absolute...