A simplification of the computation of the natural representation of the symmetric group $S\sb{n}$

Joseph M. Clifton

Proceedings of the American Mathematical Society · 1981 · 38 citations · 1 references

DOIFull text

Open access

Concepts

Abstract

Recent use of the symmetric group S" in processing identities in nonassociative algebras has brought a renewed interest in the natural (integral) irreducible representation of S" Using a construction due to A Young, H. Boerner gives a prescription for writing down the natural (integral) irreducible representation of the symmetric group S" over an algebraically closed field of characteristic zero [1, p. 119]. Writing down the matrices using this prescription is rather tedious, and becomes computationally impossible for large n (n > 9) because of the need to calculate chains. In this paper, we simplify the computation of these matrices by eliminating the need to calculate chains. The calculation of the chains is replaced by the simple act of setting up and inverting an upper triangular matrix A,.

References

1