Prefer a chat interface with context about you and your work?
Product sets cannot contain long arithmetic progressions
Let $B$ be a set of complex numbers of size $n$. We prove that the length of the longest arithmetic progression contained in the product set $B.B = \{bb'\mid b, b' \in B\}$ cannot be greater than $O(\frac{n\log^2 n}{\log \log n})$ and present an example o