\(u_q\)-sharp subsets of a finite field (Q4832292)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2124964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(u_q\)-sharp subsets of a finite field |
scientific article; zbMATH DE number 2124964 |
Statements
4 January 2005
0 references
0.85094523
0 references
0.84977096
0 references
0.8480545
0 references
0.8450661
0 references
0.84229237
0 references
0.84018445
0 references
\(u_q\)-sharp subsets of a finite field (English)
0 references
The Cauchy-Davenport theorem, which states that \(| A+B| \geq \min\{p, | A| +| B| -1\}\) for non-empty subsets \(A,B\) of a finite field, is surprisingly difficult to prove (though there are now several proofs in the literature). Here the author contributes a new proof by thinking of \(A\) and \(B\) as the value sets of certain polynomials \(f(x)\) and \(g(y)\) in one variable and thus \(A+B\) as the value set of \(f(x)+g(y)\). From the construction of \(f\) and \(g\) (the clever bit being to define \(f\) and \(g\) over a suitable field extension when things gets awkward), the Cauchy-Davenport theorem follows easily. It may well be that other key results of ``additive combinatorics'' may follow more simply from the author's new perspective. For the entire collection see [Zbl 1048.11003].
0 references