Abstract In this work, we present an algorithmic treatment of the representation theory of the algebra of partially transposed permutation operators, denoted by A p , p d , which is a matrix representation of the abstract walled Brauer algebra. We provide an explicit and fully developed framework for constructing irreducible matrix units within the algebra. In contrast to the established earlier Gelfand–Tsetlin type constructions, the presented matrix units are adapted to the action of the subalgebra C S p × C S p , where S p is the symmetric group. What is more, the basis is constructed in such a way that it produces the decomposition of the algebra into a direct sum of ideals, in contrast to its nested structure considered before. The decomposition of this kind has not been considered before in full generality. Our method reveals a recursive scheme for generating irreducible matrix units in all ideals of A p , p d , offering a systematic approach that applies to small system sizes and arbitrary local dimensions. We apply the developed formalism to the algebra A 2 , 2 d and illustrate the algorithm in practice. In addition, using the constructed basis, we proved a novel contraction theorem for the elements from A 3 , 3 d , which is the starting point for further investigations.
Alicki et al. (Wed,) studied this question.