Roth's theorem in \(\mathbb Z^n_4\) (Q847041): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3125540216 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0807.5101 / rank | |||
Normal rank |
Latest revision as of 17:12, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Roth's theorem in \(\mathbb Z^n_4\) |
scientific article |
Statements
Roth's theorem in \(\mathbb Z^n_4\) (English)
0 references
11 February 2010
0 references
In 1953, \textit{K. F. Roth} [J. Lond. Math. Soc. 29, 20--26 (1953; Zbl 0055.27201)] proved that any subset of \(\mathbb{Z}_n\) of sufficiently large density contains a proper three-term arithmetic progression. This result was improved by \textit{R. Meshulam} [J. Comb. Theory, Ser. A 71, No. 1, 168--172 (1995; Zbl 0832.11006)]. Namely, he proved that if \(G\) is a finite abelian group of odd order, and \(A\subset G\) contains no proper three-term arithmetic progression, then \[ |A|=O(|G|/\log^c|G|), \] where \(c\) is an explicit constant. In the more special case, when \(G\) is specialized to \(\mathbb{Z}_3^n\), the bounds are ``better'', although finding the best bound is still an open question. The present author goes to an other direction. In this paper \(G\) is taken to be \(\mathbb{Z}_4^n\). The main result is the following bound on \(|A|\): \[ |A|=O(|G|/\log|G|\log\log^c|G|), \] where the constant is the same as in Meshulam's result.
0 references
Roth-Meshlam
0 references
Roth's theorem
0 references
arithmetic progression
0 references
cap set problem
0 references
Balog-Szemerédi
0 references