Some parts of my research are related to the implementing practical algorithms and problems for algebra, group theory and combinatorics on the computer systems such as GAP and Maple.
1. I am the developer of the refereed package REPSN for the computer algebra system GAP. It is for constructing matrix representations in characteristic zero of finite groups. The first verion of REPSN is released on May 2004. The current version is 3.0.1. All functions in REPSN package are written entirely in the GAP language. To see a flowchart of the algorithm used in this package click here. Its manual is available in html and pdf.
2. I have provided a database of finite perfect groups of orders up to 1,000,000 for Maple. To download this package click here and before using read the README file.
3. I (with Greg Fee) have provided a finite groups package for Maple. This is a library of permutation representations of small, simple and classical groups. It contains functions for creating some standard finite groups. To see a manual of this package click here. This package works best on Maple 10 and higher. To download this package click here and before using read the README file.
4. I have written some programs called branching on GAP and Maple, for computing constituents and multiplicities of restriction and induction of characters of the symmetric groups.
