Fast Fourier Transforms for Wreath Products

@inproceedings{RockmoreDepartment1994FastFT,
  title={Fast Fourier Transforms for Wreath Products},
  author={Daniel N. RockmoreDepartment},
  year={1994}
}
  • Daniel N. RockmoreDepartment
  • Published 1994
In this paper fast Fourier transform algorithms (FFT's) are constructed for wreath products of the form GS n ]. Examples of interest include the hyperoctahedral groups B n (the symmetry groups of the n-cube) as well as more generally AS n ] for any abelian groups A and also the full wreath products S m S n ] and their iterates, often identiied as automorphism groups of spherically homogeneous rooted trees. In general, direct computation of the discrete Fourier transform for any nite group H… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 39 references

Representations of Permutations Groups I, II Lecture Notes in Math- ematics, Vols

  • A. Kerber
  • 1971
Highly Influential
4 Excerpts

An algorithm for machine calculation of complex

  • J. W. Cooley, J. W. Tukey
  • Fourier series. Math. Comput
  • 1965
Highly Influential
7 Excerpts

E cient computation of the Fourier transform on - nite groups

  • P. Diaconis, D. Rockmore
  • Journal of the American Mathematical Society
  • 1990
Highly Influential
6 Excerpts

Group Representations in Probability and Statistics, IMS, Hayward, CA

  • P. Diaconis
  • 1988
Highly Influential
5 Excerpts

The Representation Theory of the Symmetric Groups

  • G. D. James
  • Lecture Notes in Mathematics.,
  • 1978
Highly Influential
3 Excerpts

Computing Fourier transforms and convolutions onthe 2 - sphere

  • J. R. Driscoll, D. Healy.
  • Adv . in Appl . Math .
  • 1993

Similar Papers

Loading similar papers…