Year: 2023
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Authors: Bary-Soroker, Lior, Goldgraber, Noam
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4386648013