Tilted irreducible representations of the permutation group

Published: 01-01-1995| Version 1 | DOI: 10.17632/rmb5p75p8n.1
G. Bergdolt


Abstract A fast algorithm to compute irreducible integer representations of the symmetric group is described. The representation is called tilted because the identity is not represented by a unit matrix, but a matrix β satisfying a reduced characteristic equation of the form (β - I)^k= 0. A distinctive feature of the approach is that the non-zero matrix elements are restricted to ±1. A so called natural representation is obtained by multiplying each representation matrix by β^(-1). Alternatively t... Title of program: TMRP Catalogue Id: ADBC_v1_0 Nature of problem Irreducible integer representations of the permutation group are computed. Versions of this program held in the CPC repository in Mendeley Data ADBC_v1_0; TMRP; 10.1016/0010-4655(95)00009-5 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)