Integer sequences and semidefinite programming (Q2707265)
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 1583175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integer sequences and semidefinite programming |
scientific article; zbMATH DE number 1583175 |
Statements
1 April 2001
0 references
discrepancy
0 references
arithmetic progression
0 references
semidefinite optimization
0 references
0.93135417
0 references
0.90025145
0 references
0.89089805
0 references
0.8858166
0 references
0.8858166
0 references
0.88217044
0 references
0.8806629
0 references
Integer sequences and semidefinite programming (English)
0 references
A theorem of \textit{K. F. Roth} [Acta Arith. 9, 257-260 (1964; Zbl 0125.29601)] asserts that for any sequence \(x_1, \dots, x_n\) of \(\pm 1\)'s there is an arithmetical progression \(A\) such that \(|\sum _{i\in A} x_i|\gg n^{1/4} \). The proof is simple and beautiful. The author considers a related square mean, which is a linear function in the variables \(y_{ij}=x_ix_j\). Then the restriction that \(y_{ij}\) is of this form is replaced by the weaker assumption that the matrix \((y_{ij})\) is positive semidefinite, and the resulting optimization problem is solved.
0 references
