Defragmentation of permutation tables with four columns

摘要

We consider a table with columns each of which contains each symbol of an alphabetA precisely once; the remaining elements of a column are equal to zero. It is required to transformthe table preserving the sets of elements in each row and each column to the form with consecutivelyplaced elements of alphabet A in each row. We give conditions for solvability of this problem.