Highly Influenced

# Fast Fourier Transforms for Wreath Products

@inproceedings{RockmoreDepartment1994FastFT, title={Fast Fourier Transforms for Wreath Products}, author={Daniel N. RockmoreDepartment}, year={1994} }

- 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