Computational Bounds for Doing Harmonic Analysis on Permutation Modules of Finite Groups

Computational Bounds for Doing Harmonic Analysis on Permutation Modules of Finite Groups

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of permutation modules, and it uses the multiplicities of irreducible...

Full description

Bibliographic Details
Main Authors: Hansen, Michael, Koyama, Masanori, McDermott, Matthew B. A., Orrison, Michael E., Wolff, Sarah
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: Springer US 2021
Online Access:https://hdl.handle.net/1721.1/133126

Internet

https://hdl.handle.net/1721.1/133126

Similar Items