Open Access Senior Thesis
Bachelor of Science
Ghassan Sarkis (Pomona)
A discrete Fourier transform, or DFT, is an isomorphism from a group algebra to a direct sum of matrix algebras. An algorithm that efficiently applies a DFT is called a fast Fourier transform, or FFT. The concept of a DFT will be introduced and examined from both a general and algebraic perspective. We will then present and analyze a specific FFT for the symmetric group.
Brand, Tristan, "A Fast Fourier Transform for the Symmetric Group" (2006). HMC Senior Theses. 179.