Geometric progressions in vector sumsets over finite fields (Q1994969)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Geometric progressions in vector sumsets over finite fields |
scientific article; zbMATH DE number 7312729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Geometric progressions in vector sumsets over finite fields |
scientific article; zbMATH DE number 7312729 |
Statements
Geometric progressions in vector sumsets over finite fields (English)
0 references
18 February 2021
0 references
For \(q\) a prime power and \(d, k \in \mathbb N\), denote by \(G_{k,d}(q)\) the least \(G\) such that if \[ A, B \subseteq \mathbb F_q^d, \qquad |A| \cdot |B| \ge G \] then there exist \(\mathbf v, \boldsymbol \lambda \in \mathbb F_q^d \setminus \{ \boldsymbol 0 \}\) such that \[ A + B \supseteq \{ (v_1 \lambda_1^j, \cdots, v_d \lambda_d^j): 0 \le j \le k-1 \}. \] Refining previous work with \textit{O. Ahmadi} from [Monatsh. Math. 152, No. 3, 177--185 (2007; Zbl 1140.11010)], the author shows that \[ G_{k,d}(q) \ll_d (q^d)^{2-2/k}. \] In particular, a power saving is obtained over the trivial bound \((q^d)^2\). The author remarks that no non-trivial lower bound is known. The method combines the existing exponential sum approach with an induction on the dimension.
0 references
geometric progression
0 references
sumset
0 references
exponential sums
0 references
0.931544542312622
0 references
0.9219027757644652
0 references
0.7896777391433716
0 references
0.789638340473175
0 references
0.7893906831741333
0 references