Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Computing the discriminants of Brauer’s centralizer algebras
HTML articles powered by AMS MathViewer

by Phil Hanlon and David Wales PDF
Math. Comp. 54 (1990), 771-796 Request permission


This paper discusses a computational problem arising in the study of the structure theory of Brauer’s orthogonal and symplectic centralizer algebras. The problem is to compute the ranks of certain combinatorially defined matrices ${Z_{m,k}}(x)$ (these matrices are presented in $\S 2$). This computation is difficult because the sizes of the matrices ${Z_{m,k}}(x)$ are enormous even for small values of m and k. However, there is a great deal of symmetry amongst the entries of the matrices. In this paper we show how to design algorithms that take full advantage of this symmetry, using the representation theory of the symmetric groups. We also present data collected using these algorithms and a number of conjectures about the centralizer algebras.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 20G20, 20C30
  • Retrieve articles in all journals with MSC: 20G20, 20C30
Additional Information
  • © Copyright 1990 American Mathematical Society
  • Journal: Math. Comp. 54 (1990), 771-796
  • MSC: Primary 20G20; Secondary 20C30
  • DOI:
  • MathSciNet review: 1010599