[with patch, positive review] Double coset problems
|Reported by:||rlm||Owned by:||rlm|
|Report Upstream:||Work issues:|
Description (last modified by )
Implements computations of properties which form double cosets. For example, if G is isomorphic to H, and m : G -> H is an isomorphism, then the set of all isomorphisms is the double coset Aut(H) m Aut(G).
This algorithm is pretty close to the canonical label algorithm, but it is a more efficient way to implement the isomorphism question. If the objects are not isomorphic, it will tend to discover this pretty quickly, via refinement invariants and examining the partition structure. If they are isomorphic, chances are this isomorphism will be discovered quickly and the algorithm will terminate at that moment.
Change History (16)
comment:1 Changed 9 years ago by
- Summary changed from [with patch, not ready for review] Double coset problems to [with patch, needs review] Double coset problems
Changed 9 years ago by
comment:14 Changed 9 years ago by
- Summary changed from [with patch, needs review] Double coset problems to [with patch, positive review] Double coset problems