Separation of variables and the computation of fourier transforms on finite groups, I

Journal of the American Mathematical Society

Volumn 10, Issue 1, 1997, Pages 169-214

  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

EID: 85009731502     PISSN: 08940347     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0894-0347-97-00219-1     Document Type: Article

References (69)

1. E. Assmus Jr. and J. Key, Designs and their codes, Cambridge Univ. Press, Cambridge, 1992.MR 93j:51003
2. M. Atkinson, The complexity of group algebra computations, Theoret. Comput. Sci. 5 (1977), 205–209.MR 80a:16020
3. L. Auslander and R. Tolimieri, Is computing with the fast Fourier transform pure or applied mathematics?, Bull. Amer. Math. Soc. (N.S.) 1 (1979), 847–897.MR 81e:42020
4. L. Babai, K. Freidl and M. Stricker, Decomposition of *-closed algebras in polynomial time, Proc. 18th ACM ISSAC (1993), 86–94.
5. L. Babai, E. Luks, and A. Seress, Fast management of permutation groups, Proc. 28th IEEE FOCS (1988), 272–282.
6. L. Babai and L. Rónyai, Computing irreducible representations of finite groups, Math. Comp. 55 (1990), 705–722.MR 91d:68057
7. U. Baum, Existence and efficient construction of fast Fourier transforms for supersolvable groups, Comput. Complexity 1 (1991), 235–256.MR 93d:20031
8. U. Baum and M. Clausen, Some lower and upper complexity bounds for generalized Fourier transforms and their inverses, SIAM J. Comput. 20(3) (1991), 451–459.MR 91m:68100
9. U. Baum, M. Clausen and B. Tietz, Improved upper complexity bounds for the discrete Fourier transform, Appl. Algebra Engrg. Comm. Comput. 2 (1991), 35–43.MR 94f:65129
10. R. Beals and L. Babai, Las Vegas algorithms for matrix groups, Proc. 34th IEEE FOCS (1993), 427–436.
11. L. Beckett and P. Diaconis, Spectral analysis for discrete longitudinal data, Adv. Math. 103 (1994), 107–128.MR 95d:62151
12. T. Beth, On the computational complexity of the general discrete Fourier transform, Theoret. Comput. Sci. 51 (1987), 331–339.MR 88i:20009
13. T. Beth, Verfahren der schnellen Fourier-Transformation, Teubner Studienb¨ucher, Stuttgart, 1984.MR 86g:65002
14. A. Borel, R. Carter, C. Curtis, N. Iwahori, T. Springer and R. Steinberg, Seminar on algebraic groups and related finite groups, Lecture Notes in Math., vol. 131, Springer-Verlag, New York, 1970.MR 41:3486
15. R. Carter, Simple groups of Lie type, Wiley-Interscience, New York, 1989.MR 90g:20001
16. R. Carter, Finite groups of Lie type: conjugacy classes and characters, Wiley-Interscience, New York, 1985.MR 87d:20060
17. M. Clausen, Fast Fourier transforms for metabelian groups, SIAM J. Comput. 18 (1989), 584–593.MR 90e:94002
18. M. Clausen, Fast generalized Fourier transforms, Theoret. Comput. Sci. 67 (1989), 55–63.MR 91f:68081
19. M. Clausen, Beiträge zum Entwurf schneller Spektraltransformationen, Habilitationsschrift, Fakultät f¨ur Informatik der Universität Karlsruhe (TH), 1988.
20. M. Clausen and U. Baum, Fast Fourier transforms, Wissenschaftsverlag, Mannheim, 1993.MR 96i:68001
21. M. Clausen and U. Baum, Fast Fourier transforms for symmetric groups, theory and implementation, Math. Comp. 61 (204) (1993), 833–847.MR 94a:20028
22. J. Cooley, The re-discovery of the fast Fourier transform algorithm, Mikrochimica Acta III (1987), 33–45.
23. J. Cooley, How the FFT gained acceptance, Proceedings of the ACM Conference on the History of Scientific and Numeric Computation, Princeton, NJ May 13–15, 1987, 133–140. CMP 93:07
24. J. Cooley and J. Tukey, An algorithm for machine calculation of complex Fourier series, Math. Comp. 19 (1965), 297–301.MR 31:2843
25. P. Deligne and G. Lusztig, Representations of reductive groups over finite fields, Ann. Of Math. 103 (1976), 103–161.MR 52:14076
26. P. Diaconis, A generalization of spectral analysis with applications to ranked data, Ann. Statist. 17 (1989), 949–979.MR 91a:60025
27. P. Diaconis, Group representations in probability and statistics, IMS, Hayward, CA, 1988.MR 90a:60001
28. P. Diaconis and D. Rockmore, Efficient computation of isotypic projections for the symmetric group, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 11, L. Finkelstein and W. Kantor (eds.), 1993, 87–104.MR 94g:20022
29. P. Diaconis and D. Rockmore, Efficient computation of the Fourier transform on finite groups, J. Amer. Math. Soc. 3(2) (1990), 297-332.MR 92g:20024
30. J. R. Driscoll and D. Healy. Computing Fourier transforms and convolutions on the 2-sphere, (extended abstract) Proc. 34th IEEE FOCS, (1989), 344–349
31. Adv. in Appl. Math. 15 (1994), 202–250.MR 95h:65108
32. D. F. Elliott and K. R. Rao, Fast transforms: algorithms, analyses, and applications, Academic Press, New York, 1982.MR 85e:94001
33. A. Fässler and E. Stiefel, Group theoretical methods and their applications, Birkhäuser, Boston, MA, 1992.MR 93a:20023
34. I. M. Gel'fand and M. Tsetlin, Finite dimensional representations of the group of unimodular matrices, Dokl. Akad. Nauk SSSR 71 (1950), 825–828 (Russian).
35. F. Goodman, P. de la Harpe and V. Jones, Coxeter graphs and towers of algebras, Springer- Verlag, New York, 1989.MR 91c:46082
36. T. Hagedorn, Multiplicities in restricted representations, Ph.D. Thesis, Department of Mathematics, Harvard University, 1994.
37. F. Harary, Graph theory, Addison-Wesley, Reading, MA, 1972.MR 41:1566
38. D. Healy, D. Maslen, S. Moore, D. Rockmore and M. Taylor, Applications of a fast convolution algorithm on the 2-sphere, Technical Report, Department of Mathematics and Computer Science, Dartmouth College, 1994.
39. M. T. Heideman, D. H. Johnson, and C. S. Burrus, Gauss and the history of the fast Fourier transform, Archive for History of Exact Sciences 34(3) (1985), 265–277.MR 87f:01018
40. H. Hiller, The geometry of coxeter groups, Research Notes in Mathematics vol. 54, Pitman, 1982.MR 83h:14045
41. G. James, The representation theory of the symmetric groups, Lecture Notes in Math., vol. 682, Springer-Verlag, New York, 1978.MR 80g:20019
42. G. James, Representations of general linear groups, LMS vol. 94, Cambridge Univ. Press, Cambridge, 1984.MR 86j:20036
43. M. Karpovsky, Fast Fourier transforms on finite nonabelian groups IEEE Trans. Comput. 26(10) (1977), 1028–1030.MR 58:15646
44. M. Karpovsky and E. Trachtenberg, Filtering in a communication channel by Fourier transforms over finite groups, Spectral Techniques and Fault Detection, M. Karpovsky (ed.) Academic Press, NY (1985), 179–212.MR 86i:94081
45. A. Kerber, Representations of permutations groups. I, II, Lecture Notes in Math., vols. 240, 495, Springer-Verlag, Berlin (1971), (1975).MR 48:4098; MR 53:13376
46. A. Klimyk and N. Vilenkin, Representations of Lie groups and special functions. I, II, and III, Mathematics and Its Applications (Soviet Series), vols. 72, 74, 75, Kluwer, Boston, 1991, 1993.MR 93h:33009; MR 94m:22001; MR 96f:33043
47. J. Lafferty and D. Rockmore, Fast Fourier analysis for SL2 over a finite field and related numerical experiments, J. Exp. Math. 1 (1992) 115–139.MR 94f:11131
48. S. Linton, G. Michler, and J. Olsson, Fourier transforms with respect to monomial representations, Math. Ann. 297 (1993), 253–268.MR 94i:20015
49. D. Maslen, Efficient computation of Fourier transforms on compact groups, Max-Planck preprint MPI/95-8 (1995).
50. D. Maslen and D. Rockmore, Generalized FFTs - a survey of some recent results, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Groups and Computation, II, L. Finkelstein and W. Kantor (eds.), (to appear).
51. D. Maslen and D. Rockmore, Separation of variables and the efficient computation of Fourier transforms on finite groups, II, (in preparation).
52. D. Maslen and D. Rockmore, Adapted diameters and the efficient computation of Fourier transforms of finite groups, Proceedings of the 1995 ACM-SIAM Symposium on Discrete Algorithms, 253–262.MR 95k:65131
53. J. Nelder, The analysis of randomized experiments with orthogonal block structure, I and II, Proc. of the Royal Acad., Series A 283 (1965), 147–162 and 163–178.MR 31:848; MR 30:4363
54. A. Oppenheim and R. Schafer, Discrete-time signal processing. Prentice Hall, NJ, 1989.
55. D. Rockmore, Some applications of generalized FFTs, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Groups and Computation, II, L. Finkelstein and W. Kantor (eds.), (to appear).
56. D. Rockmore, Fast Fourier transforms for wreath products, Appl. Comput. Harmon. Anal. 4 (1995), 34–55.
57. D. Rockmore, Efficient computation of Fourier inversion for finite groups, J. Assoc. Comput. Mach. 41(1) (1994), 31–66.MR 96j:65153
58. D. Rockmore, Fast Fourier analysis for abelian group extensions, Adv. in Appl. Math. 11 (1990), 164–204.MR 91k:68091
59. J. Serre, Linear representations of finite groups, Springer-Verlag, New York, 1977.MR 56:8675
60. C. Sims, Computational methods in the study of permutation groups, Computational Problems in Abstract Algebra, J. Leech (ed.), Pergamon Press 1970, 169–183.MR 41:1856
61. R. Stong, Some asymptotic results on finite vector spaces, Adv. in Appl. Math. 9 (1988), 167–199.MR 89c:05007
62. E. Thoma, Die Einschrankung der Charaktere von GL(n; q) auf GL(n − 1; q), Math. Z. 119 (1971), 321–338.MR 44:5388
63. R. Tolimieri, M. An, and C. Lu, Algorithms for discrete Fourier transform and convolution, Springer-Verlag, New York, 1989.MR 93i:65131
64. C. Van Loan, Computational framework for the fast Fourier transform, SIAM, Philadelphia, 1992.MR 93a:65186
65. G. Wall, On the conjugacy classes in the unitary, symplectic and orthogonal groups, J. Austral. Math. Soc. 3 (1963), 1–62.MR 27:212
66. A. Willsky, On the algebraic structure of certain partially observable finite-state Markov processes, Inform. Contr. 38 (1978), 179–212.
67. S. Winograd, Arithmetic complexity of computations, SIAM CBMS-NSF Series, 33, SIAM, Philadelphia PA, 1980.MR 81k:68039
68. C. M. Woodman. The symmetry groups of non-rigid molecules as semi-direct products, Mol. Phys. (6) 19 (1970), 753–780.
69. A. Zelevinsky. Representations of finite classical groups, Lecture Notes in Math., vol. 869, Springer-Verlag, New York, 1981.MR 83k:20017