We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
In this thesis, we present a new class of algorithms that determine fast Fourier transforms for a given finite group G. These algorithms use eigenspace projections determined by a chain of subgroups of G, and rely on a path algebraic approach to the representation theory of finite groups developed by Ram (26). Applying this framework to the symmetric group, Sn, yields a class of fast Fourier transforms that we conjecture to run in O(n2n!) time. We also discuss several future directions for this research
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.