The Yuszinsky conjecture is concerned with a problem in the combinatorics of matrix coloring.Given an r by s matrix M,one seeks to color its entries using n colors such that (i) each row should have no repeated colors,(ii) each column should have no repeated colors and (iii) each 2 by 2 sub-matrix of M contains either two colors or 4 colors.In 1981 S.Yuzvinsky conjectured that the minimal number n of colors required is given by a certain numerical function on r and s that is already familiar in dyadic arithmetic.