Implemented functions in ParentLibGAP

Author: RuchitJagodara

src/sage/groups/libgap_wrapper.pyx

@@ -345,6 +345,33 @@ class ParentLibGAP(SageObject):
         """
         return self._libgap._repr_()
 
+    def minimal_normal_subgroups(self):
+        """
+        Return a list containing those nontrivial normal subgroups of the group that are minimal among the nontrivial normal subgroups.
+
+        EXAMPLES::
+
+            sage: G = PermutationGroup([(1,2,3),(4,5)])
+            sage: G.minimal_normal_subgroups()
+            [Subgroup generated by [(4,5)] of (Permutation Group with generators [(4,5), (1,2,3)]),
+             Subgroup generated by [(1,2,3)] of (Permutation Group with generators [(4,5), (1,2,3)])]
+        """
+        return [self.subgroup(gap_subgroup.GeneratorsOfGroup()) for gap_subgroup in self.gap().MinimalNormalSubgroups()]
+
+    def maximal_normal_subgroups(self):
+        """
+        Return a list containing those proper normal subgroups of the group G that are maximal among the proper normal subgroups.
+        Gives error if G/G' is infinite, yielding infinitely many maximal normal subgroups.
+
+        EXAMPLES::
+
+            sage: G = PermutationGroup([(1,2,3),(4,5)])
+            sage: G.maximal_normal_subgroups()
+            [Subgroup generated by [(1,2,3)] of (Permutation Group with generators [(4,5), (1,2,3)]),
+             Subgroup generated by [(4,5)] of (Permutation Group with generators [(4,5), (1,2,3)])]
+        """
+        return [self.subgroup(gap_group=gap_subgroup) for gap_subgroup in self.gap().MaximalNormalSubgroups()]
+
     @cached_method
     def gens(self):
         """

src/sage/groups/perm_gps/permgroup.py

@@ -4106,33 +4106,6 @@ def isomorphism_type_info_simple_group(self):
         else:
             raise TypeError("group must be simple")
 
-    def minimal_normal_subgroups(self):
-        """
-        Return a list containing those nontrivial normal subgroups of the group that are minimal among the nontrivial normal subgroups.
-
-        EXAMPLES::
-
-            sage: G = PermutationGroup([(1,2,3),(4,5)])
-            sage: G.minimal_normal_subgroups()
-            [Subgroup generated by [(4,5)] of (Permutation Group with generators [(4,5), (1,2,3)]),
-             Subgroup generated by [(1,2,3)] of (Permutation Group with generators [(4,5), (1,2,3)])]
-        """
-        return [self.subgroup(gap_group=gap_subgroup) for gap_subgroup in self.gap().MinimalNormalSubgroups()]
-
-    def maximal_normal_subgroups(self):
-        """
-        Return a list containing those proper normal subgroups of the group G that are maximal among the proper normal subgroups.
-        Gives error if G/G' is infinite, yielding infinitely many maximal normal subgroups.
-
-        EXAMPLES::
-
-            sage: G = PermutationGroup([(1,2,3),(4,5)])
-            sage: G.maximal_normal_subgroups()
-            [Subgroup generated by [(1,2,3)] of (Permutation Group with generators [(4,5), (1,2,3)]),
-             Subgroup generated by [(4,5)] of (Permutation Group with generators [(4,5), (1,2,3)])]
-        """
-        return [self.subgroup(gap_group=gap_subgroup) for gap_subgroup in self.gap().MaximalNormalSubgroups()]
-
     ######################  Boolean tests #####################
 
     def is_abelian(self):