A repository for the code from my Senior Thesis in Mathematics: designing fast algorithms to change bases in the context of the action of the symmetric group on tabloid spaces.
The inverse taken during the projection operator computation is unnecessary and can be removed. It may add a slight increase in speed, though likely not much.
nPartitions(n) can be replaced by a function in the main routine nPartitions(lambda) that produces only those partitions that will contribute to the rep. decomposition over the space of tabloids of shape lambda. This should be faster to run than nPartitions(n) alone and save computation time during the main routine.