Computational Bounds for Doing Harmonic Analysis on Permutation Modules of Finite Groups
Preprint
Abstract
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 submodules within individual orbital spaces to express the resulting computational bounds. We conclude by showing that these bounds are surprisingly small when dealing with certain permutation modules arising from the action of the symmetric group on tabloids.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Analyzing and Modeling Rank Data2014
- Voting, the Symmetric Group, and Representation TheoryThe American Mathematical Monthly, 2009
- Fourier Analysis on Finite Groups and Applications1999
- Separation of variables and the computation of Fourier transforms on finite groups, IJournal of the American Mathematical Society, 1997
- Group Theoretical Methods and Their Applications1992
- A Generalization of Spectral Analysis with Application to Ranked DataThe Annals of Statistics, 1989