On the Freiman theorem in finite fields (Q2518063): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Q219786 / rank | |||
Property / author | |||
Property / author: Sergei V. Konyagin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On small sumsets in \((\mathbb{Z}/2\mathbb{Z})^n\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SETS WITH SMALL SUMSET AND RECTIFICATION / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Freiman's Theorem in Finite Fields via Extremal Set Theory / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1134/s0001434608090137 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2058985675 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:38, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Freiman theorem in finite fields |
scientific article |
Statements
On the Freiman theorem in finite fields (English)
0 references
12 January 2009
0 references
In a wonderful recent paper [J. Aust. Math. Soc. 86, No. 1, 61--74 (2009; Zbl 1232.11014)] \textit{B. Green} and \textit{T. Tao} largely resolved the problem of Freiman's theorem in \(\mathbb F_2^n\). Specifically they showed that if \(A \subset \mathbb F_2^n\) has \(|A+A| \leq K|A|\) then there is a subspace \(V \leq \mathbb F_2^n\) containing \(A\) such that \(|V| \leq 2^{2K+O(\sqrt{K}\log K)}|A|\). On the other hand an easy example showes that this bound must be at least \(2^{2K - O(\log K)}|A|\). In the present paper the author improves the bound in Green and Tao's argument to \(|V|\leq 2^{2K+O(\log K)}|A|\). The author improves the error term in Green and Tao's Proposition 5.1 by a nice combinatorial argument which can be completed in a page but places our state of knowledge in a very satisfying position.
0 references
Freiman theorem
0 references
set addition
0 references
finite field
0 references
Abelian group
0 references
Hamming metric
0 references
arithmetic progression
0 references
doubling constant
0 references