No label defined (Q5619113)
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 3342867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3342867 |
Statements
1970
0 references
From the introduction: Let us consider a quadratic \( n \times \dot{n} \) matrix with elements \(\pm 1\). We can multiply arbitrary rows and columns by \(-1\) and our aim is to minimize the absolute value of the sum of elements of the matrix. In other words we want to draw the number of \(+1\) to that of \(-1\) as near as possible. Put \( S_{n}= \) \[ S_{n}=\max _{\left(a_{1 j}\right)} \min _{x_{1}, y_{j}}\left|\sum_{j, j=1}^{n} a_{1}, x_{i} y_{j}\right|, \] where \( x_{1}, y_{j} \) take the values \(\pm 1\) in all possible ways and the maximum is extended for all \( n \times n \) matrices \( \left(a_{1 j}\right. \) ) with elements \(\pm 1\). Erdős has remarked that by applying the central limit theorem it is easy to show that \( S_{n} \leq \sqrt{cn\log n} \). Moser and Moon have guessed that for all \(n\) \(S_n\le 2\). In this paper we prove this conjecture for \(n\ge n_0\). More precisely (for \(n>n_0\)) \[ S_n=1\text{ if }n \text{ is odd, } S_n=2\text{ if }n \text{ is even.} \tag{1} \] [Actually we shall prove that \(S_n\le 2\), but this is equivalent to (1) as for odd \(n\) \(S_n\ge 1\), and the example (\(a_{ii}=-1, a_{ij}=1\) for \(i+j>2\)) shows that for even \(n\) \(S_n\ge 2\).]
0 references