Below is the summary:
This project aimed to implement free groups, finitely presented groups and various algorithms like Coset Enumeration using Todd Coxeter method, Low index subgroup and Reidemeister schreier. Computation of order, index and other properties of the finitely presented groups is now present. The functionality is added in the combinatorics module of SymPy. He laid the groundwork for further addition of other algorithms and integrate it with the permutation groups.