Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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



Computing irreducible representations of supersolvable groups

Authors: Ulrich Baum and Michael Clausen
Journal: Math. Comp. 63 (1994), 351-359
MSC: Primary 20C40; Secondary 20C15, 68Q40
MathSciNet review: 1226811
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time $ O({n^2}\log n)$. We present an improved algorithm with running time $ O(n\log n)$.

References [Enhancements On Off] (What's this?)

  • [1] L. Babai and L. Rónyai, Computing irreducible representations of finite groups, Proc. 30th IEEE Sympos. Foundations of Comput. Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 93-98.
  • [2] U. Baum, Existence and efficient construction of fast Fourier transforms on supersolvable groups, Comput. Complexity 1/3 (1992), 235-256. MR 1165193 (93d:20031)
  • [3] M. Clausen, Fast generalized Fourier transforms, Theoret. Comput. Sci. 67 (1989), 55-63. MR 1015084 (91f:68081)
  • [4] A. Fässler and E. Stiefel, Group theoretical methods and their applications, Birkhäuser, Boston, 1992. MR 1158662 (93a:20023)
  • [5] C. R. Leedham-Green, A soluble group algorithm, Computational Group Theory (M. D. Atkinson, ed.), Academic Press, London, 1984, pp. 85-101. MR 760653 (86c:20030)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 20C40, 20C15, 68Q40

Retrieve articles in all journals with MSC: 20C40, 20C15, 68Q40

Additional Information

Article copyright: © Copyright 1994 American Mathematical Society

American Mathematical Society