Decomposing monomial representations of solvable groups

Journal of Symbolic Computation

Volumn 34, Issue 6, 2002, Pages 561-596

  Püschel, Markus ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036899226     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2002.0566     Document Type: Article

References (33)

1. Auslander, L., Feig, E., Winograd, S. (1984). Abelian semi-simple algebras and algorithms for the discrete fourier transform. Adv. Appl. Math., 5, 31-55.
2. Baum, U., Clausen, M. (1994). Computing irreducible representations of supersolvable groups. Math. Comput., 63, 351-359.
3. Beth, T. (1984). Verfahren der Schnellen Fouriertransformation. Teubner.
4. Clausen, M. (1988). Beiträge zum Entwurf schneller Spektraltransformationen (Habilitationsschrift). University of Karlsruhe.
5. Clausen, M. (1997). A direct proof of Minkwitz's extension theorem. AAECC, 8, 305-306.
6. Clausen, M., Baum, U. (1993). Fast Fourier Transforms. Mannheim: BI-Wiss.-Verl.
7. Clausen, M., Müller, M. (2002). Generating fast Fourier transforms of solvable groups. J. Symb. Comput., special issue on Computer Algebra Signal Processing, to appear.
8. Cooley, J. W., Tukey, J. W. (1965). An algorithm for the machine calculation of complex fourier series. Math. Comput., 19, 297-301.
9. Curtis, W. C., Reiner, I. (1962). Representation Theory of Finite Groups. Interscience
10. Curtis, W. C., Reiner, I. (1981). Methods of Representation Theory, volume 1. Interscience.
11. Diaconis, P., Rockmore, D. (1990). Efficient computation of the Fourier transform on finite groups. J. AMS, 3, 297-332.
12. Dixon, J., Mortimer, B. (1996). Permutation Groups. Springer.
13. Dornhoff, L. (1971). Group Representation Theory, Pure and Applied Mathematics. New York, Dekker.
14. Egner, S., Johnson, J., Padua, D., Püschel, M., Xiong, J. (2001). Automatic derivation and implementation of signal processing algorithms. ACM SIGSAM Bull. Commun. Comput. Algeb., 35, 1-19.
15. Egner, S., Püschel, M. (1998). AREP - A Package for Constructive Representation Theory and Fast Signal Transforms, GAP share package.http://www.ece.cmu.edu/~smart/arep/arep. html.
16. Egner, S., Püschel, M. (2001). Automatic generation of fast discrete signal transforms. IEEE Trans. Signal Process., 49, 1992-2002.
17. Egner, S., Püschel, M. (2002). Symmetry-based matrix factorization. J. Symb. Comput. Special Issue on Comput. Algebra Signal Process, to appear.
18. GAP (1997). GAP - Groups, Algorithms, and Programming. U. St. Andrews, Scotland, The GAP Team, School of Mathematical and Computational Sciences, http://www-gap.dcs.st-and.ac.uk/-gap/.
19. Heideman, M., Johnson, D., Burrus, C. (1985). Gauss and the history of the fast Fourier transform. Arch. History Exact Sci., 34, 265-277.
20. Linton, S. A., Michler, G. O., Olsson, J. B. (1993). Fourier transforms with respect to monomial representations. Math. Annalen, 297, 253-268.
21. Maslen, D., Rockmore, D. (1995). Generalized FFTs - A survey of some recent results. In Proceedings of IMACS Workshop in Groups and Computation, volume 28, pp. 182-238.
22. Maslen, D., Rockmore, D. (1997). Separation of variables and the computation of fourier transforms on finite groups, I. J. Am. Math. Soc., 10, 169-214.
23. Maslen, D., Rockmore, D. (2000). Double coset decompositions and computational harmonic analysis on groups. J. Fourier Anal. Appl., 6, 349-388.
24. Minkwitz, T. (1993). Algorithmensynthese für lineare Systeme mit Symmetrie, Ph.D. Thesis. Universität Karlsruhe, Informatik.
25. Minkwitz, T. (1995). Algorithms Explained by Symmetry, LNCS 900, pp. 157-167.
26. Minkwitz, T. (1996). Extension of irreducible representations. AAECC, 7, 391-399.
27. Moura, J. M. F., Johnson, J., Johnson, R. W., Padua, D., Prasanna, V., Püschel, M., Veloso, M. M. (1998). SPIRAL: A Generator for Platform-Adapted Libraries of Signal Processing Algorithms. http://www.ece.cmu.edu/~spiral/.
28. Püschel, M. (1998). Konstruktive Darstellungstheorie und Algorithmengenerierung, Ph.D. Thesis. Universität Karlsruhe, Informatik. Also available in English as Tech. Rep. Drexel-MCS-1999-1, Drexel University, Philadelphia.
29. Rockmore, D. (1990). Fast Fourier analysis for Abelian group extensions. Adv. Appl. Math., 11, 164-204.
30. Rockmore, D. (1995). Some applications of generalized FFT's. In Proceedings of DIMACS Workshop in Groups and Computation, volume 28, pp. 329-370.
31. Serre, J. P. (1977). Linear Representations of Finite Groups. Springer.
32. Terras, A. (1999). Fourier Analysis on Finite Groups and Applications. Cambridge University Press.
33. Wielandt, H. (1964). Finite Permutation Groups. Academic Press.