Adapted diameters and the efficient computation of fourier transforms on finite groups

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 253-262

  Maslen, David K ^a   Rockmore, Daniel N ^b  

^a MAX PLANCK INSTITUT FÜR MATHEMATIK   (Germany)

^b DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHAINS; COMPUTATIONAL EFFICIENCY; DISCRETE FOURIER TRANSFORMS; FACTORIZATION; GROUP THEORY; MATRIX ALGEBRA; SIGNAL PROCESSING;

BEST-KNOWN ALGORITHMS; COMMUTATIVITY PROPERTIES; COMPLEXITY RESULTS; COMPUTATIONAL GROUP THEORY; EFFICIENT COMPUTATION; FINITE GROUPS OF LIE TYPE; IRREDUCIBLE MATRICES; SEPARATION OF VARIABLES;

LIE GROUPS;

EID: 77649148930     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. L. Babai, E Luks, and A.- Seress. Fast management of permutation groups, Proc. 28th IEEE FOCS (1988), pp. 272-282.
2. L. Babai and L. Rónyai. Computing irreducible representations of finite groups. Math. Comp. 55 (1990), 705-722.
3. L. Babai, K. Freidl and M. Strieker. Decomposition of-closed algebras in polynomial time. Proc. of 18th ACM ISSAC (1993), pp. 86-94.
4. R. Beals. and L. Babai. Las Vegas algorithms for matrix groups. Proc. 34th IEEE FOCS (1993), pp. 427-436.
5. U. Baum. Existence and efficient construction of fast Fourier transforms for supersolvable groups. Computational Complexity, 1 (1991), 235-256.
6. U. Baum and M. Clausen. Some lower and upper complexity bounds for generalized Fourier transforms and their inverses. SIAM J. Comput. 20(3) (1991), 451459.
7. T. Beth. On the computational complexity of the general discrete Fourier transform, Theoretical Computer Science 51 (1987), 331-339.
8. N. Bshouty, M. Kaminski, and D. Kirkpatrick. Addition requirements for matrix and transposed matrix products. J. of Algorithms 9 (1988), 354-364.
9. R. Carter. Simple Groups of Lie Type. Wiley-Interscience, NY (1989).
10. M. Clausen and U. Baum. Fast Fourier Transforms, Wissenschaftsverlag, Manheim (1993).
11. M. Clausen and U. Baum, Fast Fourier transforms for symmetric groups, theory and implementation. Math. Comp. 61(204) (1993), 833-847.
12. M. Clausen. Fast Fourier transforms metabel- ian groups. SIAM J. Comput. 18 (1989), 584-593.
13. M. Clausen. Fast generalized Fourier transforms. Theor. Comp. Sci. 67 (1989), 55-63.
14. J. W. Cooley and J. W. Tukey. An algorithm for machine calculation of complex Fourier series. Math. Comput. 19 (1965), 297-301.
15. P. Diaconis. Group Representations in Probability and Statistics, IMS, Hayward, CA (1988).
16. P. Diaconis and D. Rockmore. Efficient computation of the Fourier transform on finite groups. J. of the A.M.S. 3(2) (1990), 297-332.
17. P. Diaconis and D. Rockmore. Efficient computation of isotypic projections for the symmetric group. DIM ACS Series in Disc. Math., Vol. 11 (eds. L. Finkelstein and W. Kantor), 87-104 (1993).
18. J. R. Driscoll and D. Healy. Computing Fourier transforms and convolutions on the 2-sphere. (Extended abstract) Proc. ZAth IEEE FOCS, (1989) pp. 344-349; (Adv. in Appl. Math., To appear.
19. D. F. Elliott and K. R. Rao. Fast Transforms: Algorithms, Analyses, and Applications. Academic, New York (1982).
20. L. Finkelstein and W. Kantor. Groups and Computation, DIM ACS Series in Disc. Math., Vol. 11, AMS (1993) .
21. T. Hagedorn. Multiplicities in Restricted Representations of GLn(Fq), Un(Fq) and SOn(Fq). Ph.D. Thesis, Department of Mathematics, Harvard University (1994) .
22. F. Harary. Graph Theory. Addison-Wesley, Reading, MA (1972).
23. D. Healy, D. Maslen, S. Moore, and D. Rockmore. Applications of a fast convolution algorithm on the 2-sphere. Technical Report, Department of Mathematics and Computer Science, Dartmouth College (1994).
24. G. D. James. The Representation Theory of the Symmetric Groups. Lecture Notes in Mathematics., Vol. 682, Springer-Verlag, Berlin (1978).
25. G. D. James. Representations of General Linear Groups. LMS Vol. 94, Cambridge Univ. Press, Cambridge (1984).
26. M. Karpovsky and E. Trachtenberg, Filtering in a communication channel by Fourier transforms over finite groups, in Spectral Techniques and Fault Detection, M. Karpovsky (ed.) Acaddemic Press, NY (1985), pp. 179212.
27. A. Kerber. Representations of Permutations Groups I, II Lecture Notes in Mathematics, Vols. 240 and 495, Springer-Verlag, Berlin (1971) and (1975).
28. S. Linton, G. Michler, and J. Olsson. Fourier transforms with respect to monomial representations. Math. Ann. 297 (1993), 253-268.
29. D. Rockmore. Efficient computation of Fourier inversion for finite groups. J. of the A. CM. 41(1) (1994), 31-66.
30. D. Rockmore. Fast Fourier analysis for abelian group extensions. Adv. in Appl. Math. 11 (1990), 164-204.
31. D. Rockmore. Fast Fourier transforms for wreath products. Technical Report, Dept. of Mathematics, Dartmouth College (1994).
32. J. P. Serre. Linear Representations of Finite Groups. Springer-Verlag, New York (1977).
33. C. C. Sims, Computational methods in the study of permutation groups, in: Computational Problems in Abstract Algebra, J. Leech, ed., Pergamon Press 1970, pp. 169-183.
34. R. Stong. Some asymptotic results on finite vector spaces. Adv. in Appl. Math. 9 (1988), 167-199.
35. E. Thoma. Die Einschränkung der Charaktere von GL(n, q) auf GL(n-l, q). Math. Zeit, 119 (1971) 321338.
36. R. Tolimieri, M. An, and C. Lu. Algorithms for Discrete Fourier Transform and Convolution. Springer-Verlag, New York (1989).
37. C. Van Loan. Computational Framework for the Fast Fourier Transform, SIAM, Philadelphia (1992).