Google Summer of Code 2012: Week 11
August 6, 2012Posted by on
Hi all, here’s a brief summary of the 11th week of my GSoC.
- Yay! Subgroup searching now works with the use of .stabilizer(), as I discussed in my previous blog post. Surprisingly, the running time is similar to that of the flawed version using .baseswap() (whenever the one using .baseswap() works), you can play around with the two versions on my week6 (has a bug, using .baseswap()) and week9 (seems to work, using .stabilizer()) branches.
- Consequently, I made a new pull request containing the incremental version of Schreier-Sims, the remove_gens utility for getting rid of redundant generators in a strong generating set, and the new (working) subgroup_search algorithm. You’re most welcome to help with the review!
- I worked on several applications of subgroup_search() and the incremental Schreier-Sims algorithm. Namely, the pointwise stabilizer of a set of points (via the incremental Schreier-Sims algorithm):
In : from sympy.combinatorics.named_groups import * In : A = AlternatingGroup(9) In : G = A.pointwise_stabilizer([2, 3, 5]) In : G == A.stabilizer(2).stabilizer(3).stabilizer(5) Out: True
(this is much faster than the naive implementation using .stabilizer() repeatedly), and the centralizer of a group inside a group :
In : from sympy.combinatorics.named_groups import * In : S = SymmetricGroup(6) In : A = AlternatingGroup(6) In : C = CyclicGroup(6) In : S_els = list(S.generate()) In : G = S.centralizer(A) In : G.order() Out: 1 In : temp = [[el*gen for gen in A.generators] == [gen*el for gen in A.generators] for el in S_els] In : temp.count(False) Out: 719 In : temp.count(True) Out: 1 In : G = S.centralizer(C) In : G == C Out: True In : temp = [[el*gen for gen in C.generators] == [gen*el for gen in C.generators] for el in S_els] In : temp.count(True) Out: 6
(it takes some effort to see that these calculations indeed prove that .centralizer() returned the needed centralizer). The centralizer algorithm uses a pruning criterion described in , and even though it’s exponential in complexity, it’s fast for practical purposes. Both of the above functions are available (albeit not documented yet) on my week10 branch.
- The next steps are an algorithm for the centre in polynomial time, and an algorithm to find the intersection of two subgroups! And after that, I hope to be able to implement the Todd-Coxeter algorithm…
That’s it for now!
 Derek F. Holt, Bettina Eick, Bettina, Eamonn A. O’Brien, “Handbook of computational group theory”, Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL, 2005. ISBN 1-58488-372-3