Translation invariant equations and the method of Sanders (Q2918796)
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 6092635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Translation invariant equations and the method of Sanders |
scientific article; zbMATH DE number 6092635 |
Statements
Translation invariant equations and the method of Sanders (English)
0 references
10 October 2012
0 references
translation invariant equations
0 references
arithmetic progressions
0 references
additive combinatorics
0 references
The author considers a linear equation NEWLINE\[NEWLINEc_1 x_1+\cdots+ c_s x_s= 0,\quad c_j\neq 0,\quad s\geq 3\quad\text{and}\quad c_1+\cdots+ c_s= 0.\tag{1}NEWLINE\]NEWLINE Extending the result of Sanders. The author proves:NEWLINENEWLINE Theorem. The sine of the largest subset of \(A\in\{1,\dots, N\}\) having no solutions of equation (1) differ from the form \((a_1,\dots, a)\in A^s\) is NEWLINE\[NEWLINE|A|= O\left(N\left({(\log\log N)^s\over\log N}\right)^{s-2}\right).NEWLINE\]NEWLINE A similar result is obtained in the ring of polynomials \(\mathbb F_q[t]\) over a finite field.
0 references
0.824980616569519
0 references
0.7523675560951233
0 references
0.7518076300621033
0 references
0.7478694915771484
0 references
0.745539665222168
0 references