- multivariate polynomial division to compute multivariate reminder term.
- schrier sims algorithm to compute a good representation of subgroups of the symmetric group. Formally, compute a strong generating set.
- todd coxeter algorithm to compute the permutation representation of the cosets of a subgroup. Formally, build the schrier graph and extract the coset table.
- Bucchberger algorithm to computing grobner basis of ideal.
- Fundamental theorem of symmetric polynomials to write a given symmetric polynomial in terms of elementary symmetric polynomials.
- Plucker coordinates implements common graphics operations via plucker coordinates, as a step to understand the grassmanian
- Schubert decomposition of the grassmanian to compute the cohomology of the grassmanian.
- Algorithms on tableaux in particular, implement RSK to show the RSK correspondence, and also implement the fourier transform on the symmetric group.
- Monster computing products of elements in the monster group.
- Bijective combinatorics: Chapter on Tableaux.
- SnoB: FFT for the symmetric group
- FTSP: Fundamental theorem of symmetric polynomials
- Ideals, Varieties, Algorithms
- Serees: Permutation group algorithms