Generating fast Fourier transforms of solvable groups


This paper presents a new algorithm for constructing a complete list of pairwise inequivalent ordinary irreducible representations of a finite solvable group G. The input of the algorithm is a pc-presentation corresponding to a composition series refining a chief series of G. Modifying the Baum-Clausen-Algorithm for supersolvable groups and combining this… (More)
DOI: 10.1016/j.jsc.2002.06.006


Cite this paper

@article{Clausen2004GeneratingFF, title={Generating fast Fourier transforms of solvable groups}, author={Michael Clausen and Meinard M{\"u}ller}, journal={J. Symb. Comput.}, year={2004}, volume={37}, pages={137-156} }