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...
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 |
Similar Items
-
Finite Permutation Groups
by: Praeger, C
Published: (1973) -
Finite permutation groups
by: Liebeck, M, et al.
Published: (1979) -
Infinite bounded permutation groups
by: Adeleke, SA, et al.
Published: (1996) -
S-Permutability, Semipermutability, c-Normality And
c-Permutability Of Subgroups In Finite Groups
by: Al-Sharo, Doa'a Mustafa
Published: (2014) -
A study of some finite permutation groups
by: Neumann, P
Published: (1966)