I have an algorithm that runs quickly for groups of order 18 or less. On Wednesday, December 20, 2023 at 11:56:18 AM UTC-6 [email protected] wrote:
> Unfortunately, I don't think that there is any capability like > AllSubgroups in GAP in SymPy > GAP (ref) - Chapter 39: Groups (gap-system.org) > <https://docs.gap-system.org/doc/ref/chap39.html#X80399CD4870FFC4B> > I also tried to find solutions, but it is not very trivial at least > because naive solution by definition (just to test all subsets of groups) > isn't feasibily fast enough even for small textbook problems. > So we need to implement some real algorithm for this > > > On Saturday, December 16, 2023 at 11:18:18 AM UTC+3 [email protected] > wrote: > > I probably should have mentioned that I have written a script for this > that identifies inverses and then checks subsets using the one-step > subgroup test. > > On Tuesday, December 12, 2023 at 5:51:06 AM UTC-6 Douglas Gray wrote: > > Hey, Everybody. > > Let me say, first, that I am a mathematician, not a comp-sci person. I am > using sympy.combinatorics.named_groups to import different groups. Has > anyone out there written a code to identify all subgroups of a given group? > > -- 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/99e40c78-9463-4301-9a4c-c1c8735636f7n%40googlegroups.com.
