Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T09:45:48.814Z Has data issue: false hasContentIssue false

On compound permutation matrices

Published online by Cambridge University Press:  20 January 2009

A. C. Aitken
Affiliation:
The Mathematical Institute, The University, Edinburgh, 1.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In an earlier paper1 the author investigated the relation existing between the induced matrices of a group of permutation matrices and the table of group characters of the irreducible representations of the corresponding symmetric group. It was found that the traces of a particular set of induced matrices sufficed to give, by a relatively simple transformation, the complete table of characters.It was remarked also that for n > 4 the set of compound matrices of permutation matrices, on the other hand, could at most provide only part of the table; for in fact the number of compounds, n + 1. is then less than P (n), the numbe'r of partitions of n. For this reason the subject was not pursued into further detail.

Information

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 1946