“…The monoid I n is also known in the literature as the rook monoid because of the alternate characterisation of partial permutations by {0, 1}-matrices with at most one non-zero entry in each row and each column; such matrices are in one-to-one correspondence with placements of non-attacking rooks on an n × n chess board. While the representation theory of the rook monoid is well studied (see for example [22,37,39,55,56,71,72,77,81,82]), there has also been substantial recent interest in the representation theory of wreath products G ≀ I n , where G is a group (definitions are given below). See especially the work of Steinberg [83,84] and Mazorchuk and Srivastava [69].…”