An unsolved problem is to enumerate all solutions for the matrix equation A2= J where A is a n n×n (0,1) -matrix and J is the n × n matr trix with every entry being l. Here we present a family of n×n generalized circulant (0, 1)- matrices each of whose square is J. Moreover, the existence of this family is unique up to permutational similarity. |