Arithmetic and Geometric Progressions in Productsets over Finite Fields
Igor E. Shparlinski

TL;DR
This paper investigates the presence of long arithmetic and geometric progressions within productsets over finite fields, establishing conditions on set sizes and field characteristics for their guaranteed existence.
Contribution
It provides new bounds and conditions under which productsets in finite fields contain long arithmetic and geometric progressions, extending previous combinatorial results.
Findings
Productsets contain arithmetic progressions of length k ≥ 3 when k<p and set sizes are sufficiently large.
Similar results are obtained for geometric progressions in shifted productsets.
Conditions relate the size of sets and the characteristic of the finite field for progression existence.
Abstract
Given two sets of elements of the finite field of elements, we show that the productset contains an arithmetic progression of length provided that , where is the characteristic of , and # \cA # \cB \ge 3q^{2d-2/k}. We also consider geometric progressions in a shifted productset , for , and obtain a similar result.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Limits and Structures in Graph Theory
