Timeline for Function that Generates all Normal Subgroups of a Group
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2022 at 12:38 | answer | added | yode | timeline score: 1 | |
| Apr 2, 2018 at 23:06 | comment | added | Michael E2 | If you're going to do a lot of group theory computation, you might want to use a more specialized piece of software such as GAP or Magma | |
| Apr 2, 2018 at 15:20 | comment | added | Omari Celestine | @b3m2a1 Do you think you can demonstrate with an example? | |
| Apr 2, 2018 at 14:25 | comment | added | b3m2a1 | There's a straightforward, from-the-definitions way to implement this, but it'll be inefficient. Map your operation and use Sort to check whether your group is closed and while doing that make sure there's an element that doesn't require Sort for equality. Then check whether the group itself is normal using the left and right cosets. Then recursively check if for normality as you drop elements other than the identity (as you know that has to be in there) using a depth-first recurrence and some caching to avoid rechecking things. It'll be slow though (like worse than $O((n \log n)^2)$). | |
| Apr 2, 2018 at 13:31 | history | asked | Omari Celestine | CC BY-SA 3.0 |