Balancing matrices with line shifts


We give a purely deterministic proof of the following theorem of J. Komlós and M. Sulyok. LetA=(a ij ),a ij =±1 be ann×n matrix. One can multiply some rows and columns by −1 such that the absolute value of the sum of the elements of the matrix is ≦2 ifn is even and 1 ifn is odd. Note that Komlós and Sulyok applied probabilistic ideas and so their method worked only forn>n 0.

This is a preview of subscription content, access via your institution.


  1. [1]

    T. A. Brown andJ. H. Spencer, Minimization of ±1 matrices under line shifts,Colloquium Mathematicum (Poland)23 (1971), 165–171.

    MATH  MathSciNet  Google Scholar 

  2. [2]

    J. Beck andT. Fiala, Integer Making Theorems,Discrete Applied Math. 3 (1981), 1–8.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    J. Komlós andM. Sulyok. On the sum of elements of ±1 matrices, in:Combinatorial Theory and Its Applications (Erdős et al., eds.), North-Holland 1970, 721–728.

Download references

Author information



Additional information

Dedicated to Paul Erdős on his seventieth birthday

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Beck, J., Spencer, J. Balancing matrices with line shifts. Combinatorica 3, 299–304 (1983).

Download citation

AMS subject classification (1980)

  • 05 B 20