The authors give a deterministic proof [not a probabilistic one as in the original paper written by \textit{J. Komlós} and \textit{M. Suliok}, Comb. Theory Appl., Colloquia Math. Soc. János Bolyai 4, 721-728 (1970; Zbl 0216.020)] of the following theorem: If \(A=(a_{ij})\), with \(a_{ij}=\pm 1\) is a \(n\times n\) matrix, then it is possible to multiply some rows and columns by -1 such that the absolute value of the sum of the elements of the matrix is \(\leq 2\), if n is even and 1 if n is odd.
Recommendations
Cited in
(13)- A new approach to the covering radius of codes
- On joint realization of (0,1) matrices
- Transmitting in the n-dimensional cube
- Constants of the Kahane-Salem-Zygmund inequality asymptotically bounded by 1
- A combinatorial proof of Fisher's inequality
- scientific article; zbMATH DE number 4177072 (Why is no real title available?)
- scientific article; zbMATH DE number 3885925 (Why is no real title available?)
- scientific article; zbMATH DE number 812062 (Why is no real title available?)
- Balancing Regular Matrix Pencils
- Burning Hamming graphs
- On existence theorems
- Alon's transmitting problem and multicolor Beck-Spencer Lemma
- Permutations of series in infinite-dimensional spaces
This page was built for publication: Balancing matrices with line shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795048)
