加载中…
We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field variants of Erdős’ multiplication table problem.

生成讲解博客的中文版本

生成AI智能校验的中文版本