Hello, I have several ideas in computational group theory that seem doable. I am wondering if these have been considered before and if they are in the scope of GSoC for Sympy. I have worked with GAP and in particular used it to compute cohomology groups and character tables. In general the goal could be to implement several algorithms in the chapter of Holt's book on representation theory, and cohomology groups(chapter 7). Following are some ideas:
1. Computing first and second cohomology groups of finitely presented groups over a finite field or the integers 2. Compute character tables of finite groups (using Burnside-Dixon-Schneider algorithm) 3. Test irreducibility of given representation (using Meataxe algorithm) 4. Adding classes on finite groups based on the ATLAS database of finite groups (http://brauer.maths.qmul.ac.uk/Atlas/v3/) Since any of these ideas don't appear on the GSoC ideas page, please could you give me some feedback if they would be of general interest and can be considered as part of a GSoC project. Best, Aniket -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/dea71c1f-ee84-4792-b00c-7c635c5f33fdn%40googlegroups.com.
