Abstract
Let G be a finite group of order n. By Wedderburn’s Theorem, the complex group algebra ℂG is isomorphic to an algebra of block diagonal matrices: \( \mathbb{C}G \simeq \oplus _{k = 1}^h \mathbb{C}^{d_k \times d_k } \). Every such isomorphism D, a so-called discrete Fourier transform of ℂG, consists of a full set of pairwise inequivalent irreducible representations Dk of ℂG. A result of Morgenstern combined with the well-known Schur relations in representation theory show that (under mild conditions) any straight line program for evaluating a DFT needs at least Ω(nlogn) operations. Thus in this model, every O(nlogn) FFT of ℂG is optimal up to a constant factor. For the class of supersolvable groups we will discuss a program that from a pc-presentation of G constructs a DFT D = ⊕D k of ℂG and generates an O(nlogn) FFT of ℂG. The running time to construct D is essentially proportional to the time to write down all the monomial (!) twiddle factors D k(g i ) where the gi are the generators corresponding to the pc-presentation. Finally, we sketch some applications.
Keywords
- Fast Fourier Transform
- Irreducible Representation
- Conjugacy Class
- Discrete Fourier Transform
- Irreducible Character
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baum, U.: Existence and efficient construction of fast Fourier transforms for super solvable groups. Computational Complexity, 1 (1991), 235–256.
Baum, U., Clausen, M.: Some lower and upper complexity bounds for generalized Fourier transforms and their inverses. SIAM J. Comput., 20 (1991), 451–459.
Baum, U., Clausen, M.: Computing irreducible representations of super solvable groups. Mathematics of Computation, Volume 63, Number 207 (1994) 351–359.
Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, Volume 315, Springer Verlag, Berlin, 1997.
Clausen, M., Baum, U.: Fast Fourier Transforms. BI-Wissenschaftsverlag, Mannheim, 1993.
Clausen, M., Baum, U.: Ein kombinatorischer Zugang zur Darstellungstheorie überauflösbarer Gruppen. Bayreuther Mathematische Schriften, 44 (1993), 99–107.
Morgenstern, J.: Complexité linéaire de calcul. Thèse, Univ. de Nice, 1978.
Omrani, A., Shokrollahi, M.A.: Computing irreducible representations of super solvable groups over small finite fields. Mathematics of Computation, Volume 66, Number 218 (1997) 779—786.
Serre, J.P.: Linear Representations of Finite Groups. Graduate Texts in Mathematics, Springer, 1986.
Sims, C.C.: Computation with finitely presented groups. Cambridge University Press, 1994.
Sims, C.C.: Fast multiplication and growth in groups. ISSAC’98, Rostock, Germany (1998), 165–170.
Thümmel, A.: Computing character tables of p-groups. pp. 150–154 in Proceedings ISSAC’96, Zürich, Switzerland.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clausen, M., Müller, M. (1999). A Fast Program Generator of Fast Fourier Transforms. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_4
Download citation
DOI: https://doi.org/10.1007/3-540-46796-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66723-0
Online ISBN: 978-3-540-46796-0
eBook Packages: Springer Book Archive