Graduation Year
2007
Document Type
Open Access Senior Thesis
Degree Name
Bachelor of Science
Department
Mathematics
Reader 1
Michael Orrison
Reader 2
Nathan Ryan (UCLA)
Abstract
A Discrete Fourier Transform (DFT) changes the basis of a group algebra from the standard basis to a Fourier basis. An efficient application of a DFT is called a Fast Fourier Transform (FFT). This research pertains to a particular type of FFT called Decimation in Frequency (DIF). An efficient DIF has been established for commutative algebra; however, a successful analogue for non-commutative algebra has not been derived. However, we currently have a promising DIF algorithm for CSn called Orrison-DIF (ODIF). In this paper, I will formally introduce the ODIF and establish a bound on the operation count of the algorithm.
Recommended Citation
Koyama, Masanori, "A Decimation-in-Frequency Fast-Fourier Transform for the Symmetric Group" (2007). HMC Senior Theses. 199.
https://scholarship.claremont.edu/hmc_theses/199
