Skip to main content
Article thumbnail
Location of Repository

An efficient computer program for the symbolic construction of irreducible representation of supersolvable groups

By Meinard Müller and Michael Clausen

Abstract

Baum and Clausen have presented in [1] an algorithm, refered to as BC-Algorithm, for the construction of a complete list of pairwise inequivalent ordinary irreducible representations for a given finite supersolvable group G. This algorithm is almost optimal in the sense that the running time is proportional to the length of the output up to some logarithmic factors. In this paper we describe an implementation, which realizes this algorithm for the first time efficiently concerning the running time as well as the memory requirements. Extensive tests have shown that the actual running time behaviour of the computer program reflects very well the theoretical complexity bounds. Furthermore, all arithmetic operations of the BC-Algorithm are done symbolically over Z/Ze, where e denotes the exponent of G

Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.4581
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.uni-bonn.de/~mei... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.