(self, alpha, pairs=False)
return _orbit_transversal(self._degree, self.generators, alpha, pairs)
r"""Computes a transversal for the orbit of ``alpha`` as a set.

        For a permutation group ``G``, a transversal for the orbit
        ``Orb = \{g(\alpha) | g \in G\}`` is a set
        ``\{g_\beta | g_\beta(\alpha) = \beta\}`` for ``\beta \in Orb``.
        Note that there may be more than one possible transversal.
        If ``pairs`` is set to ``True``, it returns the list of pairs
        ``(\beta, g_\beta)``. For a proof of correctness, see [1], p.79

        Examples
        ========

        >>> from sympy.combinatorics import Permutation
        >>> Permutation.print_cyclic = True
        >>> from sympy.combinatorics.perm_groups import PermutationGroup
        >>> from sympy.combinatorics.named_groups import DihedralGroup
        >>> G = DihedralGroup(6)
        >>> G.orbit_transversal(0)
        [Permutation(5),
         Permutation(0, 1, 2, 3, 4, 5),
         Permutation(0, 5)(1, 4)(2, 3),
         Permutation(0, 2, 4)(1, 3, 5),
         Permutation(5)(0, 4)(1, 3),
         Permutation(0, 3)(1, 4)(2, 5)]

        See Also
        ========

        orbit
r"""Computes a transversal for the orbit of ``alpha`` as a set.
r Computes a transversal for the orbit of alpha as a set .
def orbit_transversal(self, alpha, pairs=False):
        r"""Computes a transversal for the orbit of ``alpha`` as a set.

        For a permutation group ``G``, a transversal for the orbit
        ``Orb = \{g(\alpha) | g \in G\}`` is a set
        ``\{g_\beta | g_\beta(\alpha) = \beta\}`` for ``\beta \in Orb``.
        Note that there may be more than one possible transversal.
        If ``pairs`` is set to ``True``, it returns the list of pairs
        ``(\beta, g_\beta)``. For a proof of correctness, see [1], p.79

        Examples
        ========

        >>> from sympy.combinatorics import Permutation
        >>> Permutation.print_cyclic = True
        >>> from sympy.combinatorics.perm_groups import PermutationGroup
        >>> from sympy.combinatorics.named_groups import DihedralGroup
        >>> G = DihedralGroup(6)
        >>> G.orbit_transversal(0)
        [Permutation(5),
         Permutation(0, 1, 2, 3, 4, 5),
         Permutation(0, 5)(1, 4)(2, 3),
         Permutation(0, 2, 4)(1, 3, 5),
         Permutation(5)(0, 4)(1, 3),
         Permutation(0, 3)(1, 4)(2, 5)]

        See Also
        ========

        orbit

        """
        return _orbit_transversal(self._degree, self.generators, alpha, pairs)
def orbit_transversal ( self , alpha , pairs = False ) : return _orbit_transversal ( self . _degree , self . generators , alpha , pairs )