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 (Author), Koyama, Masanori (Author), McDermott, Matthew B. A. (Author), Orrison, Michael E. (Author), Wolff, Sarah (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer US,
2021-10-26T15:11:13Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Finite permutation groups
by: Liebeck, Martin W.
Published: (1979) -
Finite Permutation Groups
by: Bailey, R. A.
Published: (1974) -
Finite permutation groups : on the Sylow subgroups of primitive permutation groups
by: Praeger, Cheryl E.
Published: (1973) -
Finite permutation groups, normal subgroups of multiply transitive permutation groups
by: Siemons, J.
Published: (1979) -
Finite primitive permutation groups
by: Soomro, K. D.
Published: (1981)