The original 𝕊nFFT package is a Julia package designed to facilitate harmonic analysis on the symmetric group of order n, denoted 𝕊n. 𝕊nFFT can be downloaded here. The version 𝕊nFFT𝔽p is based on representations of 𝕊n with values in a finite field 𝔽p.
The two main differences between the packages are the following:
- Young seminormal representations instead of Young orthogonal representations
- Working with
BigInt
modulo p (p prime) instead ofFloat64
Out of the box, this 𝕊nFFT𝔽p version implements:
- Group operations and factorizations for 𝕊n
- Functionality to set up 𝔽p valued functions over 𝕊n
- The fast Fourier transform
- The inverse fast Fourier transform
- The fast convolution product of functions over 𝕊n
- The fast exponentiation for the convolution product over 𝕊n