« first day (178 days earlier)      last day (174 days later) » 

Jim
Jim
19:53
6
Q: Quasi-polynomial time algorithm for permutation group isomorphism

Thomas KlimpelIs there a known $n^{\alpha \log n+O(1)}$ algorithm for permutation group isomorphism? Here $n$ is the size of the group, and the isomorphism must be a permutational isomorphism. My hope for such an algorithm comes from reading a blog post on the group isomorphism problem and its comments. Becau...

cc.complexity-theory graph-isomorphism gr.group-theory
Strong generating set
In abstract algebra, especially in the area of group theory, a strong generating set of a permutation group is a generating set that clearly exhibits the permutation structure as described by a stabilizer chain. A stabilizer chain is a sequence of subgroups, each containing the next and each stabilizing one more point. Let G ≤ S n {\displaystyle G\leq S_{n}} be a group of permutations of the set { 1 , 2 , … , ...
A base and strong generating set (BSGS) for a group can be computed using the Schreier–Sims algorithm.

« first day (178 days earlier)      last day (174 days later) »