(self)
return self._strong_gens
Return a strong generating set from the Schreier-Sims algorithm.

        A generating set ``S = \{g_1, g_2, ..., g_t\}`` for a permutation group
        ``G`` is a strong generating set relative to the sequence of points
        (referred to as a "base") ``(b_1, b_2, ..., b_k)`` if, for
        ``1 \leq i \leq k`` we have that the intersection of the pointwise
        stabilizer ``G^{(i+1)} := G_{b_1, b_2, ..., b_i}`` with ``S`` generates
        the pointwise stabilizer ``G^{(i+1)}``. The concepts of a base and
        strong generating set and their applications are discussed in depth
        in [1], pp. 87-89 and [2], pp. 55-57.

        Examples
        ========

        >>> from sympy.combinatorics.named_groups import DihedralGroup
        >>> D = DihedralGroup(4)
        >>> D.strong_gens
        [Permutation(0, 1, 2, 3), Permutation(0, 3)(1, 2), Permutation(1, 3)]
        >>> D.base
        [0, 1]

        See Also
        ========

        base, basic_transversals, basic_orbits, basic_stabilizers
Return a strong generating set from the Schreier-Sims algorithm.
Return a strong generating set from the Schreier - Sims algorithm .
def strong_gens(self):
        """Return a strong generating set from the Schreier-Sims algorithm.

        A generating set ``S = \{g_1, g_2, ..., g_t\}`` for a permutation group
        ``G`` is a strong generating set relative to the sequence of points
        (referred to as a "base") ``(b_1, b_2, ..., b_k)`` if, for
        ``1 \leq i \leq k`` we have that the intersection of the pointwise
        stabilizer ``G^{(i+1)} := G_{b_1, b_2, ..., b_i}`` with ``S`` generates
        the pointwise stabilizer ``G^{(i+1)}``. The concepts of a base and
        strong generating set and their applications are discussed in depth
        in [1], pp. 87-89 and [2], pp. 55-57.

        Examples
        ========

        >>> from sympy.combinatorics.named_groups import DihedralGroup
        >>> D = DihedralGroup(4)
        >>> D.strong_gens
        [Permutation(0, 1, 2, 3), Permutation(0, 3)(1, 2), Permutation(1, 3)]
        >>> D.base
        [0, 1]

        See Also
        ========

        base, basic_transversals, basic_orbits, basic_stabilizers

        """
        if self._strong_gens == []:
            self.schreier_sims()
        return self._strong_gens
def strong_gens ( self ) : if self . _strong_gens == [ ] : self . schreier_sims ( ) return self . _strong_gens