Completing Incomplete Commutative Latin Squares With Prescribed Diagonals

The main diagonal and the upper left-hand r × r square of an n × n array contain symbols, the remaining cells are empty. We give simple necessary and sufficient conditions for completing the array to a commutative Latin square. We apply these results to give a short proof of Cruse's theorem, and an embedding theorem for half-idempotent commutative Latin squares