passagemath-combinat 10.6.42__cp314-cp314t-win_amd64.whl

sage/combinat/colored_permutations.py

@@ -0,0 +1,2039 @@
+# sage_setup: distribution = sagemath-combinat
+r"""
+Colored permutations
+
+.. TODO::
+
+    Much of the colored permutations (and element) class can be
+    generalized to `G \wr S_n`
+"""
+import itertools
+from random import choice
+
+from sage.structure.element import MultiplicativeGroupElement
+from sage.structure.parent import Parent
+from sage.structure.unique_representation import UniqueRepresentation
+from sage.misc.inherit_comparison import InheritComparisonClasscallMetaclass
+from sage.misc.cachefunc import cached_method
+from sage.misc.lazy_import import lazy_import
+from sage.misc.misc_c import prod
+from sage.arith.functions import lcm
+
+from sage.combinat.partition_tuple import PartitionTuples, PartitionTuple
+from sage.combinat.permutation import Permutations
+from sage.rings.finite_rings.integer_mod_ring import IntegerModRing
+from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
+from sage.rings.integer_ring import ZZ
+
+lazy_import('sage.matrix.constructor', 'diagonal_matrix')
+lazy_import('sage.rings.number_field.number_field', 'CyclotomicField')
+
+
+class ColoredPermutation(MultiplicativeGroupElement):
+    """
+    A colored permutation.
+    """
+    def __init__(self, parent, colors, perm):
+        """
+        Initialize ``self``.
+
+        TESTS::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: TestSuite(s1*s2*t).run()
+        """
+        self._colors = tuple(colors)
+        self._perm = perm
+        MultiplicativeGroupElement.__init__(self, parent=parent)
+
+    def __hash__(self):
+        r"""
+        TESTS::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: for gen in s1,s2,t:
+            ....:     assert hash(gen) ^^ hash(gen._colors) == hash(gen._perm)
+        """
+        return hash(self._perm) ^ hash(self._colors)
+
+    def _repr_(self):
+        """
+        Return a string representation of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: s1*s2*t
+            [[1, 0, 0], [3, 1, 2]]
+        """
+        return repr([list(self._colors), self._perm])
+
+    def _latex_(self):
+        r"""
+        Return a latex representation of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: latex(s1*s2*t)
+            [3_{1}, 1_{0}, 2_{0}]
+        """
+        ret = "["
+        ret += ", ".join("{}_{{{}}}".format(x, c)
+                         for c, x in zip(self._colors, self._perm))
+        return ret + "]"
+
+    def __len__(self):
+        """
+        Return the length of the one line form of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(2, 3)
+            sage: s1,s2,t = C.gens()
+            sage: len(s1)
+            3
+        """
+        return len(self._perm)
+
+    def _mul_(self, other):
+        """
+        Multiply ``self`` and ``other``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: s1*s2*s1 == s2*s1*s2
+            True
+        """
+        colors = tuple(c + other._colors[val - 1]  # -1 for indexing
+                       for c, val in zip(self._colors, self._perm))
+        p = self._perm._left_to_right_multiply_on_right(other._perm)
+        return self.__class__(self.parent(), colors, p)
+
+    def __invert__(self):
+        """
+        Return the inverse of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: ~t  # indirect doctest
+            [[0, 0, 3], [1, 2, 3]]
+            sage: all(x * ~x == C.one() for x in C.gens())
+            True
+        """
+        ip = ~self._perm
+        return self.__class__(self.parent(),
+                              tuple(-self._colors[i - 1] for i in ip),  # -1 for indexing
+                              ip)
+
+    def __eq__(self, other):
+        """
+        Check equality.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: s1*s2*s1 == s2*s1*s2
+            True
+            sage: t^4 == C.one()
+            True
+            sage: s1*s2 == s2*s1
+            False
+        """
+        if not isinstance(other, ColoredPermutation):
+            return False
+        return (self.parent() is other.parent()
+                and self._colors == other._colors
+                and self._perm == other._perm)
+
+    def __ne__(self, other):
+        """
+        Check inequality.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: s1*s2*s1 != s2*s1*s2
+            False
+            sage: s1*s2 != s2*s1
+            True
+        """
+        return not self == other
+
+    def __iter__(self):
+        """
+        Iterate over ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: x = s1*s2*t
+            sage: list(x)
+            [(1, 3), (0, 1), (0, 2)]
+        """
+        yield from zip(self._colors, self._perm)
+
+    def one_line_form(self):
+        """
+        Return the one line form of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: x = s1*s2*t
+            sage: x
+            [[1, 0, 0], [3, 1, 2]]
+            sage: x.one_line_form()
+            [(1, 3), (0, 1), (0, 2)]
+        """
+        return list(self)
+
+    def __getitem__(self, key):
+        """
+        Return the specified element in the one line form of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: x = s1*s2*t
+            sage: x
+            [[1, 0, 0], [3, 1, 2]]
+            sage: x[1]
+            (0, 1)
+            sage: x[1:]
+            [(0, 1), (0, 2)]
+        """
+        if isinstance(key, slice):
+            return list(zip(self._colors[key], self._perm[key]))
+        return (self._colors[key], self._perm[key])
+
+    def colors(self):
+        """
+        Return the colors of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: x = s1*s2*t
+            sage: x.colors()
+            [1, 0, 0]
+        """
+        return list(self._colors)
+
+    def permutation(self):
+        """
+        Return the permutation of ``self``.
+
+        This is obtained by forgetting the colors.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: x = s1*s2*t
+            sage: x.permutation()
+            [3, 1, 2]
+        """
+        return self._perm
+
+    def to_matrix(self):
+        """
+        Return a matrix of ``self``.
+
+        The colors are mapped to roots of unity.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s1,s2,t = C.gens()
+            sage: x = s1*s2*t*s2; x.one_line_form()
+            [(1, 2), (0, 1), (0, 3)]
+            sage: M = x.to_matrix(); M                                                  # needs sage.rings.number_field
+            [    0     1     0]
+            [zeta4     0     0]
+            [    0     0     1]
+
+        The matrix multiplication is in the *opposite* order::
+
+            sage: M == s2.to_matrix()*t.to_matrix()*s2.to_matrix()*s1.to_matrix()       # needs sage.rings.number_field
+            True
+        """
+        Cp = CyclotomicField(self.parent()._m)
+        g = Cp.gen()
+        D = diagonal_matrix(Cp, [g ** i for i in self._colors])
+        return self._perm.to_matrix() * D
+
+    def has_left_descent(self, i) -> bool:
+        r"""
+        Return ``True`` if ``i`` is a left descent of ``self``.
+
+        Let `p = ((s_1, \ldots s_n), \sigma)` be a colored permutation.
+        We say `p` has a left `n`-descent if `s_n > 0`. If `i < n`, then
+        we say `p` has a left `i`-descent if either
+
+        - `s_i \neq 0, s_{i+1} = 0` and `\sigma_i < \sigma_{i+1}` or
+        - `s_i = s_{i+1}` and `\sigma_i > \sigma_{i+1}`.
+
+        This notion of a left `i`-descent is done in order to recursively
+        construct `w(p) = \sigma_i w(\sigma_i^{-1} p)`, where `w(p)`
+        denotes a reduced word of `p`.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(2, 4)
+            sage: s1,s2,s3,s4 = C.gens()
+            sage: x = s4*s1*s2*s3*s4
+            sage: [x.has_left_descent(i) for i in C.index_set()]
+            [True, False, False, True]
+
+            sage: C = ColoredPermutations(1, 5)
+            sage: s1,s2,s3,s4 = C.gens()
+            sage: x = s4*s1*s2*s3*s4
+            sage: [x.has_left_descent(i) for i in C.index_set()]
+            [True, False, False, True]
+
+            sage: C = ColoredPermutations(3, 3)
+            sage: x = C([[2,1,0],[3,1,2]])
+            sage: [x.has_left_descent(i) for i in C.index_set()]
+            [False, True, False]
+
+            sage: C = ColoredPermutations(4, 4)
+            sage: x = C([[2,1,0,1],[3,2,4,1]])
+            sage: [x.has_left_descent(i) for i in C.index_set()]
+            [False, True, False, True]
+        """
+        if self.parent()._m == 1:
+            return self._perm[i - 1] > self._perm[i]
+
+        if self.parent()._p > 1:
+            raise NotImplementedError("only implemented for p = 1")
+
+        if i == self.parent()._n:
+            return self._colors[-1] != 0
+        if self._colors[i - 1] != 0:
+            return self._colors[i] == 0 or self._perm[i - 1] < self._perm[i]
+        return self._colors[i] == 0 and self._perm[i - 1] > self._perm[i]
+
+    def reduced_word(self):
+        r"""
+        Return a word in the simple reflections to obtain ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(3, 3)
+            sage: x = C([[2,1,0],[3,1,2]])
+            sage: x.reduced_word()
+            [2, 1, 3, 2, 1, 3, 3]
+
+            sage: C = ColoredPermutations(4, 4)
+            sage: x = C([[2,1,0,1],[3,2,4,1]])
+            sage: x.reduced_word()
+            [2, 1, 4, 3, 2, 1, 4, 3, 2, 4, 4, 3]
+
+        TESTS::
+
+            sage: C = ColoredPermutations(3, 3)
+            sage: all(C.from_reduced_word(p.reduced_word()) == p for p in C)
+            True
+        """
+        if self == self.parent().one():
+            return []
+        I = self.parent().index_set()
+        sinv = self.parent()._inverse_simple_reflections()
+        for i in I:
+            if self.has_left_descent(i):
+                return [i] + (sinv[i] * self).reduced_word()
+        assert False, "BUG in reduced_word"
+
+    def length(self):
+        r"""
+        Return the length of ``self`` in generating reflections.
+
+        This is the minimal numbers of generating reflections needed
+        to obtain ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(3, 3)
+            sage: x = C([[2,1,0],[3,1,2]])
+            sage: x.length()
+            7
+
+            sage: C = ColoredPermutations(4, 4)
+            sage: x = C([[2,1,0,1],[3,2,4,1]])
+            sage: x.length()
+            12
+
+        TESTS::
+
+            sage: C = ColoredPermutations(3, 3)
+            sage: d = [p.length() for p in C]
+            sage: [d.count(i) for i in range(14)]
+            [1, 3, 6, 10, 15, 20, 23, 24, 23, 19, 12, 5, 1, 0]
+            sage: d = [p.length() for p in ReflectionGroup([3, 1, 3])] # optional - gap3
+            sage: [d.count(i) for i in range(14)]                      # optional - gap3
+            [1, 3, 6, 10, 15, 20, 23, 24, 23, 19, 12, 5, 1, 0]
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: d = [p.length() for p in C]
+            sage: [d.count(i) for i in range(17)]
+            [1, 3, 6, 11, 18, 27, 36, 44, 50, 52, 49, 40, 27, 14, 5, 1, 0]
+            sage: d = [p.length() for p in ReflectionGroup([4, 1, 3])] # optional - gap3
+            sage: [d.count(i) for i in range(17)]                      # optional - gap3
+            [1, 3, 6, 11, 18, 27, 36, 44, 50, 52, 49, 40, 27, 14, 5, 1, 0]
+
+            sage: C = ColoredPermutations(3, 4)
+            sage: d = [p.length() for p in C]
+            sage: [d.count(i) for i in range(22)]
+            [1, 4, 10, 20, 35, 56, 82, 112, 144, 174, 197,
+             209, 209, 197, 173, 138, 96, 55, 24, 7, 1, 0]
+            sage: d = [p.length() for p in ReflectionGroup([3, 1, 4])] # optional - gap3
+            sage: [d.count(i) for i in range(22)]                      # optional - gap3
+            [1, 4, 10, 20, 35, 56, 82, 112, 144, 174, 197,
+             209, 209, 197, 173, 138, 96, 55, 24, 7, 1, 0]
+        """
+        return ZZ(len(self.reduced_word()))
+
+# TODO: Parts of this should be put in the category of complex
+# reflection groups
+
+
+class ShephardToddFamilyGroup(UniqueRepresentation, Parent):
+    r"""
+    The Shephard-Todd family complex reflection group `G(m, p, n)`
+    realized as a subgroup of :class:`colored permutations
+    <sage.combinat.colored_permutations.ColoredPermutations>`.
+
+    A general complex reflection group is a subgroup of `GL(V)`, where
+    `V` is a `\CC` vector space, that is generated by *reflections*,
+    diagonalizable matrices with at most one eigenvalue not equal to `1`.
+    The group of colored permutations `G(m, 1, n)` are the generalized
+    permutation matrices whose entries are `m`-th roots of unity.
+    For `p | m`, the group `G(m, p, n)` is the index `p` subgroup
+    such that the product of the entries is a `m/p`-th root of unity.
+
+    By the (Chevalley-)Shephard-Todd classification of irreducible
+    finite complex reflection groups, the groups `G(m, p, n)` (with
+    `G(2, 2, 2)` being exceptionally reducible since it is the Klein
+    four group) form the only infinite family with an additional 34
+    exceptional groups `G_k`, where `4 \leq k \leq 37`. To avoid
+    ambiguities, we refer to `G(m, p, n)` as the *Shephard-Todd family
+    complex reflection group*.
+
+    INPUT:
+
+    - ``m`` -- positive integer
+    - ``p`` -- positive integer dividing ``m``
+    - ``n`` -- positive integer
+
+    REFERENCES:
+
+    - :wikipedia:`Complex_reflection_group`
+
+    EXAMPLES::
+
+        sage: # needs sage.groups
+        sage: groups.misc.ShephardToddFamily(6, 1, 4)
+        6-colored permutations of size 4
+        sage: groups.misc.ShephardToddFamily(6, 2, 4)
+        Complex reflection group G(6, 2, 4)
+        sage: groups.misc.ShephardToddFamily(6, 3, 4)
+        Complex reflection group G(6, 3, 4)
+        sage: groups.misc.ShephardToddFamily(6, 6, 4)
+        Complex reflection group G(6, 6, 4)
+    """
+    @staticmethod
+    def __classcall_private__(cls, m, p, n):
+        r"""
+        Dispatch to :class:`sage.combinat.colored_permutations.ColoredPermutations`
+        when ``p == 1``.
+
+        EXAMPLES::
+
+            sage: # needs sage.groups
+            sage: G = groups.misc.ShephardToddFamily(6, 1, 3)
+            sage: C = ColoredPermutations(6, 3)
+            sage: G is C
+            True
+        """
+        if p == 1:
+            return ColoredPermutations(m, n)
+        return super().__classcall__(cls, m, p, n)
+
+    def __init__(self, m, p, n):
+        r"""
+        Initialize ``self``.
+
+        EXAMPLES::
+
+            sage: # needs sage.groups
+            sage: G = groups.misc.ShephardToddFamily(6, 2, 3)
+            sage: TestSuite(G).run()
+            sage: G = groups.misc.ShephardToddFamily(8, 4, 1)
+            sage: TestSuite(G).run()
+
+        We skip some of the Coxeter group tests since the left descents
+        have not been implemented::
+
+            sage: # needs sage.groups
+            sage: coxeter_tests = ["_test_descents", "_test_has_descent",
+            ....:                  "_test_reduced_word", "_test_simple_projections"]
+            sage: G = groups.misc.ShephardToddFamily(2, 2, 3)
+            sage: TestSuite(G).run(skip=coxeter_tests)
+            sage: G = groups.misc.ShephardToddFamily(4, 4, 2)
+            sage: TestSuite(G).run(skip=coxeter_tests)
+        """
+        if m <= 0:
+            raise ValueError("m must be a positive integer")
+        self._m = ZZ(m)
+        self._p = ZZ(p)
+        if not self._p.divides(self._m):
+            raise ValueError("{} does not divide {}".format(self._p, self._m))
+        self._n = ZZ(n)
+        self._C = IntegerModRing(self._m)
+        self._P = Permutations(self._n)
+
+        if (self._p == 1 and (self._m == 1 or self._m == 2)
+            or (self._p == 2 and self._m == 2)
+            or (self._n == 2 and self._p == self._m)):
+            from sage.categories.finite_coxeter_groups import FiniteCoxeterGroups
+            category = FiniteCoxeterGroups()
+            if not (self._n == self._m == self._p == 2):  # special case of type D_2
+                category = category.Irreducible()
+        else:
+            from sage.categories.complex_reflection_groups import ComplexReflectionGroups
+            category = ComplexReflectionGroups().Finite().Irreducible()
+            if self._p in [1, self._m]:
+                category = category.WellGenerated()
+        Parent.__init__(self, category=category)
+
+    def _repr_(self):
+        """
+        Return a string representation of ``self``.
+
+        EXAMPLES::
+
+            sage: groups.misc.ShephardToddFamily(6, 2, 3)                               # needs sage.groups
+            Complex reflection group G(6, 2, 3)
+        """
+        return "Complex reflection group G({}, {}, {})".format(self._m, self._p, self._n)
+
+    @cached_method
+    def index_set(self):
+        r"""
+        Return the index set of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(3, 4)
+            sage: C.index_set()
+            (1, 2, 3, 4)
+
+            sage: C = ColoredPermutations(1, 4)
+            sage: C.index_set()
+            (1, 2, 3)
+
+            sage: G = groups.misc.ShephardToddFamily(6, 6, 4)                           # needs sage.groups
+            sage: G.index_set()                                                         # needs sage.groups
+            (1, 2, 3, 4)
+
+            sage: G = groups.misc.ShephardToddFamily(6, 2, 4)                           # needs sage.groups
+            sage: G.index_set()                                                         # needs sage.groups
+            (1, 2, 3, 4, 5)
+
+            sage: G = groups.misc.ShephardToddFamily(6, 6, 1)                           # needs sage.groups
+            sage: G.index_set()                                                         # needs sage.groups
+            ()
+
+            sage: G = groups.misc.ShephardToddFamily(6, 2, 1)                           # needs sage.groups
+            sage: G.index_set()                                                         # needs sage.groups
+            (1,)
+
+        TESTS::
+
+            sage: S = SignedPermutations(4)
+            sage: S.index_set()
+            (1, 2, 3, 4)
+        """
+        n = self._n
+        if self._m != 1 and self._n > 1:
+            n += 1
+        if self._p != 1 and self._p != self._m:
+            n += 1
+        return tuple(range(1, n))
+
+    def coxeter_matrix(self):
+        r"""
+        Return the Coxeter matrix of ``self``.
+
+        When the group is imprimitive and not a Coxeter group,
+        this returns ``None``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(3, 4)
+            sage: C.coxeter_matrix()                                                    # needs sage.graphs sage.modules
+            [1 3 2 2]
+            [3 1 3 2]
+            [2 3 1 4]
+            [2 2 4 1]
+
+            sage: C = ColoredPermutations(1, 4)
+            sage: C.coxeter_matrix()                                                    # needs sage.graphs sage.modules
+            [1 3 2]
+            [3 1 3]
+            [2 3 1]
+
+            sage: G = groups.misc.ShephardToddFamily(2, 2, 3)                           # needs sage.groups
+            sage: G.coxeter_matrix()                                                    # needs sage.groups
+            [1 3 3]
+            [3 1 2]
+            [3 2 1]
+
+            sage: G = groups.misc.ShephardToddFamily(2, 2, 2)                           # needs sage.groups
+            sage: G.coxeter_matrix()                                                    # needs sage.groups
+            [1 2]
+            [2 1]
+
+            sage: G = groups.misc.ShephardToddFamily(2, 2, 1)                           # needs sage.groups
+            sage: G.coxeter_matrix()                                                    # needs sage.groups
+            [1]
+
+            sage: G = groups.misc.ShephardToddFamily(5, 5, 1)                           # needs sage.groups
+            sage: G.coxeter_matrix()                                                    # needs sage.groups
+            []
+
+            sage: G = groups.misc.ShephardToddFamily(4, 4, 2)                           # needs sage.groups
+            sage: G.coxeter_matrix()                                                    # needs sage.groups
+            [1 4]
+            [4 1]
+
+            sage: G = groups.misc.ShephardToddFamily(7, 7, 2)                           # needs sage.groups
+            sage: G.coxeter_matrix()                                                    # needs sage.groups
+            [1 7]
+            [7 1]
+
+            sage: G = groups.misc.ShephardToddFamily(6, 3, 1)                           # needs sage.groups
+            sage: G.coxeter_matrix() is None                                            # needs sage.groups
+            True
+            sage: G = groups.misc.ShephardToddFamily(6, 3, 4)                           # needs sage.groups
+            sage: G.coxeter_matrix() is None                                            # needs sage.groups
+            True
+
+        TESTS::
+
+            sage: S = SignedPermutations(4)
+            sage: S.coxeter_matrix()                                                    # needs sage.graphs sage.modules
+            [1 3 2 2]
+            [3 1 3 2]
+            [2 3 1 4]
+            [2 2 4 1]
+        """
+        from sage.combinat.root_system.cartan_type import CartanType
+        if self._p == 1:
+            if self._m == 1:
+                return CartanType(['A', self._n - 1]).coxeter_matrix()
+            return CartanType(['B', self._n]).coxeter_matrix()
+        if self._p == 2 and self._m == 2:
+            if self._n == 1:
+                return CartanType(['A', self._n]).coxeter_matrix()
+            return CartanType(['D', self._n]).coxeter_matrix()
+        if self._n == 2 and self._p == self._m:
+            return CartanType(['I', self._m]).coxeter_matrix()
+        if self._p == self._m and self._n == 1:
+            return CartanType(['A', 0]).coxeter_matrix()
+
+    @cached_method
+    def one(self):
+        """
+        Return the identity element of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.one()
+            [[0, 0, 0], [1, 2, 3]]
+        """
+        return self.element_class(self, [self._C.zero()] * self._n,
+                                  self._P.identity())
+
+    def random_element(self):
+        r"""
+        Return an element of ``self`` at random.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: s = C.random_element(); s  # random
+            [[0, 2, 1], [2, 1, 3]]
+            sage: s in C
+            True
+        """
+        colors = [self._C.random_element() for _ in range(self._n)]
+        if self._p > 1:
+            while sum(colors) % self._p:
+                colors = [self._C.random_element() for _ in range(self._n)]
+        return self.element_class(self, colors, self._P.random_element())
+
+    def simple_reflection(self, i):
+        r"""
+        Return the ``i``-th simple reflection of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.gens()
+            ([[0, 0, 0], [2, 1, 3]], [[0, 0, 0], [1, 3, 2]], [[0, 0, 1], [1, 2, 3]])
+            sage: C.simple_reflection(2)
+            [[0, 0, 0], [1, 3, 2]]
+            sage: C.simple_reflection(3)
+            [[0, 0, 1], [1, 2, 3]]
+
+            sage: S = SignedPermutations(4)
+            sage: S.simple_reflection(1)
+            [2, 1, 3, 4]
+            sage: S.simple_reflection(4)
+            [1, 2, 3, -4]
+
+            sage: G = groups.misc.ShephardToddFamily(4, 2, 3)                           # needs sage.groups
+            sage: list(G.simple_reflections())                                          # needs sage.groups
+            [[[0, 0, 0], [2, 1, 3]],
+             [[0, 0, 0], [1, 3, 2]],
+             [[0, 1, 3], [1, 3, 2]],
+             [[0, 0, 2], [1, 2, 3]]]
+
+            sage: G = groups.misc.ShephardToddFamily(8, 4, 1)                           # needs sage.groups
+            sage: G.simple_reflections()                                                # needs sage.groups
+            Finite family {1: [[4], [1]]}
+
+            sage: G = groups.misc.ShephardToddFamily(8, 8, 1)                           # needs sage.groups
+            sage: G.simple_reflections()                                                # needs sage.groups
+            Finite family {}
+        """
+        if i not in self.index_set():
+            raise ValueError("i must be in the index set")
+        colors = [self._C.zero()] * self._n
+        if i < self._n:
+            p = list(range(1, self._n + 1))
+            p[i - 1] = i + 1
+            p[i] = i
+            return self.element_class(self, colors, self._P(p))
+
+        colors[-1] = self._C.one()
+        sn = self.element_class(self, colors, self._P.identity())
+        if self._p == 1:
+            return sn
+
+        if i == self._n + 1 or self._n == 1:
+            return sn ** self._p
+
+        snm = self.simple_reflection(self._n-1)
+        return sn**(self._m-1) * snm * sn
+
+    @cached_method
+    def _inverse_simple_reflections(self):
+        """
+        Return the inverse of the simple reflections of ``self``.
+
+        .. WARNING::
+
+            This returns a ``dict`` that should not be mutated since
+            the result is cached.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C._inverse_simple_reflections()
+            {1: [[0, 0, 0], [2, 1, 3]],
+             2: [[0, 0, 0], [1, 3, 2]],
+             3: [[0, 0, 3], [1, 2, 3]]}
+        """
+        s = self.simple_reflections()
+        return {i: ~s[i] for i in self.index_set()}
+
+    @cached_method
+    def gens(self) -> tuple:
+        """
+        Return the generators of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.gens()
+            ([[0, 0, 0], [2, 1, 3]],
+             [[0, 0, 0], [1, 3, 2]],
+             [[0, 0, 1], [1, 2, 3]])
+
+            sage: S = SignedPermutations(4)
+            sage: S.gens()
+            ([2, 1, 3, 4], [1, 3, 2, 4], [1, 2, 4, 3], [1, 2, 3, -4])
+        """
+        return tuple(self.simple_reflection(i) for i in self.index_set())
+
+    def matrix_group(self):
+        """
+        Return the matrix group corresponding to ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.matrix_group()                                                      # needs sage.modules sage.rings.number_field
+            Matrix group over Cyclotomic Field of order 4 and degree 2 with 3 generators (
+            [0 1 0]  [1 0 0]  [    1     0     0]
+            [1 0 0]  [0 0 1]  [    0     1     0]
+            [0 0 1], [0 1 0], [    0     0 zeta4]
+            )
+        """
+        from sage.groups.matrix_gps.finitely_generated import MatrixGroup
+        return MatrixGroup([g.to_matrix() for g in self.gens()])
+
+    def as_permutation_group(self):
+        r"""
+        Return the permutation group corresponding to ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.as_permutation_group()                                              # needs sage.groups
+            Complex reflection group G(4, 1, 3) as a permutation group
+        """
+        from sage.groups.perm_gps.permgroup_named import ComplexReflectionGroup
+        return ComplexReflectionGroup(self._m, self._p, self._n)
+
+    def _element_constructor_(self, x):
+        r"""
+        Construct an element of ``self`` from ``x``.
+
+        INPUT:
+
+        - ``x`` -- either a list of pairs ``(color, element)`` or a pair of
+          lists ``(colors, elements)``
+
+        TESTS::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: x = C([(2,1), (3,3), (3,2)]); x
+            [[2, 3, 3], [1, 3, 2]]
+            sage: x == C([[2,3,3], [1,3,2]])
+            True
+        """
+        if isinstance(x, self.element_class) and x.parent() is self:
+            return self
+        x = list(x)
+        if isinstance(x[0], tuple):
+            c = []
+            p = []
+            for k in x:
+                if len(k) != 2:
+                    raise ValueError("input must be pairs (color, element)")
+                c.append(self._C(k[0]))
+                p.append(k[1])
+            if self._p > 1 and sum(c) % self._p:
+                raise ValueError("{} is not an element".format([c, p]))
+            return self.element_class(self, c, self._P(p))
+
+        if len(x) != 2:
+            raise ValueError("input must be a pair of a list of colors and a permutation")
+        if self._p > 1 and sum(x[0]) % self._p:
+            raise ValueError("{} is not an element".format(x))
+        return self.element_class(self, [self._C(v) for v in x[0]], self._P(x[1]))
+
+    def _coerce_map_from_(self, C):
+        r"""
+        Return a coerce map from ``C`` if it exists and ``None`` otherwise.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(2, 3)
+            sage: S = SignedPermutations(3)
+            sage: C.has_coerce_map_from(S)
+            True
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.has_coerce_map_from(S)
+            False
+            sage: S = SignedPermutations(4)
+            sage: C.has_coerce_map_from(S)
+            False
+
+            sage: P = Permutations(3)
+            sage: C.has_coerce_map_from(P)
+            True
+            sage: P = Permutations(4)
+            sage: C.has_coerce_map_from(P)
+            False
+        """
+        if isinstance(C, Permutations) and C.n == self._n:
+            return lambda P, x: P.element_class(P, [P._C.zero()] * P._n, x)
+        if self._m == 2 and self._p == 1 and isinstance(C, SignedPermutations) and C._n == self._n:
+            return lambda P, x: P.element_class(P,
+                                                [P._C.zero() if v == 1 else P._C.one()
+                                                 for v in x._colors],
+                                                x._perm)
+        return super()._coerce_map_from_(C)
+
+    def __iter__(self):
+        r"""
+        Iterate over ``self``.
+
+        EXAMPLES::
+
+            sage: G = groups.misc.ShephardToddFamily(6, 3, 2)                           # needs sage.groups
+            sage: [x for x in G]                                                        # needs sage.groups
+            [[[0, 0], [1, 2]],
+             [[0, 0], [2, 1]],
+             [[0, 3], [1, 2]],
+             [[0, 3], [2, 1]],
+             [[1, 2], [1, 2]],
+             [[1, 2], [2, 1]],
+             [[1, 5], [1, 2]],
+             [[1, 5], [2, 1]],
+             [[2, 1], [1, 2]],
+             [[2, 1], [2, 1]],
+             [[2, 4], [1, 2]],
+             [[2, 4], [2, 1]],
+             [[3, 0], [1, 2]],
+             [[3, 0], [2, 1]],
+             [[3, 3], [1, 2]],
+             [[3, 3], [2, 1]],
+             [[4, 2], [1, 2]],
+             [[4, 2], [2, 1]],
+             [[4, 5], [1, 2]],
+             [[4, 5], [2, 1]],
+             [[5, 1], [1, 2]],
+             [[5, 1], [2, 1]],
+             [[5, 4], [1, 2]],
+             [[5, 4], [2, 1]]]
+        """
+        for c in itertools.product(self._C, repeat=self._n):
+            if sum(c) % self._p:
+                continue
+            for perm in self._P:
+                yield self.element_class(self, c, perm)
+
+    def cardinality(self):
+        r"""
+        Return the cardinality of ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.cardinality()
+            384
+            sage: C.cardinality() == 4**3 * factorial(3)
+            True
+        """
+        ret = self._m ** self._n * self._P.cardinality()
+        if self._p == 1:
+            return ret
+        return ret // self._p
+
+    order = cardinality
+
+    def rank(self):
+        """
+        Return the rank of ``self``.
+
+        The rank of a complex reflection group is equal to the dimension
+        of the complex vector space the group acts on.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 12)
+            sage: C.rank()
+            12
+            sage: C = ColoredPermutations(7, 4)
+            sage: C.rank()
+            4
+            sage: C = ColoredPermutations(1, 4)
+            sage: C.rank()
+            3
+        """
+        if self._m == 1:
+            return self._n - 1
+        return self._n
+
+    def degrees(self) -> tuple:
+        r"""
+        Return the degrees of ``self``.
+
+        The degrees of a complex reflection group are the degrees of
+        the fundamental invariants of the ring of polynomial invariants.
+
+        If `m = 1`, then we are in the special case of the symmetric group
+        and the degrees are `(2, 3, \ldots, n, n+1)`. Otherwise the degrees
+        are `(m, 2m, \ldots, nm)`.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.degrees()
+            (4, 8, 12)
+            sage: S = ColoredPermutations(1, 3)
+            sage: S.degrees()
+            (2, 3)
+            sage: G = groups.misc.ShephardToddFamily(6, 2, 3)                           # needs sage.groups
+            sage: G.degrees()                                                           # needs sage.groups
+            (6, 9, 12)
+
+        We now check that the product of the degrees is equal to the
+        cardinality of ``self``::
+
+            sage: prod(C.degrees()) == C.cardinality()
+            True
+            sage: prod(S.degrees()) == S.cardinality()
+            True
+            sage: prod(G.degrees()) == G.cardinality()                                  # needs sage.groups
+            True
+        """
+        # For the usual symmetric group (self._m=1) we need to start at 2
+        start = 2 if self._m == 1 else 1
+        degrees = [self._m * i for i in range(start, self._n)]
+        degrees.append(self._m * self._n // self._p)
+        return tuple(sorted(degrees))
+
+    def codegrees(self) -> tuple:
+        r"""
+        Return the codegrees of ``self``.
+
+        Let `G` be a complex reflection group. The codegrees
+        `d_1^* \leq d_2^* \leq \cdots \leq d_{\ell}^*` of `G` can be
+        defined by:
+
+        .. MATH::
+
+            \prod_{i=1}^{\ell} (q - d_i^* - 1)
+            = \sum_{g \in G} \det(g) q^{\dim(V^g)},
+
+        where `V` is the natural complex vector space that `G` acts on
+        and `\ell` is the :meth:`rank`.
+
+        If `m = 1`, then we are in the special case of the symmetric group
+        and the codegrees are `(n-2, n-3, \ldots 1, 0)`. Otherwise the degrees
+        are `((n-1)m, (n-2)m, \ldots, m, 0)`.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.codegrees()
+            (8, 4, 0)
+            sage: S = ColoredPermutations(1, 3)
+            sage: S.codegrees()
+            (1, 0)
+            sage: G = groups.misc.ShephardToddFamily(6, 2, 3)                           # needs sage.groups
+            sage: G.codegrees()                                                         # needs sage.groups
+            (12, 6, 0)
+
+        TESTS:
+
+        We check the polynomial identity::
+
+            sage: R.<q> = ZZ[]
+            sage: C = ColoredPermutations(3, 2)
+            sage: f = prod(q - ds - 1 for ds in C.codegrees())
+            sage: d = lambda x: sum(1 for e in x.to_matrix().eigenvalues() if e == 1)
+            sage: g = sum(det(x.to_matrix()) * q**d(x) for x in C)                      # needs sage.modules sage.rings.number_field
+            sage: f == g                                                                # needs sage.modules sage.rings.number_field
+            True
+        """
+        # Special case for the usual symmetric group
+        if self._m == 1:
+            return tuple([ZZ(v) for v in reversed(range(self._n-1))])
+        if self._p < self._m:
+            return tuple([self._m * i for i in reversed(range(self._n))])
+        codegrees = [self._m * i for i in reversed(range(self._n-1))]
+        codegrees.append((self._n-1)*self._m - self._n)
+        return tuple(sorted(codegrees, reverse=True))
+
+    def number_of_reflection_hyperplanes(self):
+        """
+        Return the number of reflection hyperplanes of ``self``.
+
+        The number of reflection hyperplanes of a complex reflection
+        group is equal to the sum of the codegrees plus the rank.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(1, 2)
+            sage: C.number_of_reflection_hyperplanes()
+            1
+            sage: C = ColoredPermutations(1, 3)
+            sage: C.number_of_reflection_hyperplanes()
+            3
+            sage: C = ColoredPermutations(4, 12)
+            sage: C.number_of_reflection_hyperplanes()
+            276
+        """
+        return sum(self.codegrees()) + self.rank()
+
+    def fixed_point_polynomial(self, q=None):
+        r"""
+        The fixed point polynomial of ``self``.
+
+        The fixed point polynomial `f_G` of a complex reflection group `G`
+        is counting the dimensions of fixed points subspaces:
+
+        .. MATH::
+
+            f_G(q) = \sum_{w \in W} q^{\dim V^w}.
+
+        Furthermore, let `d_1, d_2, \ldots, d_{\ell}` be the degrees of `G`,
+        where `\ell` is the :meth:`rank`. Then the fixed point polynomial
+        is given by
+
+        .. MATH::
+
+            f_G(q) = \prod_{i=1}^{\ell} (q + d_i - 1).
+
+        INPUT:
+
+        - ``q`` -- (default: the generator of ``ZZ['q']``) the parameter `q`
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.fixed_point_polynomial()
+            q^3 + 21*q^2 + 131*q + 231
+
+            sage: S = ColoredPermutations(1, 3)
+            sage: S.fixed_point_polynomial()
+            q^2 + 3*q + 2
+
+        TESTS:
+
+        We check the against the degrees and codegrees::
+
+            sage: R.<q> = ZZ[]
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.fixed_point_polynomial(q) == prod(q + d - 1 for d in C.degrees())
+            True
+        """
+        if q is None:
+            q = PolynomialRing(ZZ, 'q').gen(0)
+        return prod(q + d - 1 for d in self.degrees())
+
+    def is_well_generated(self):
+        r"""
+        Return if ``self`` is a well-generated complex reflection group.
+
+        A complex reflection group `G` is well-generated if it is
+        generated by `\ell` reflections. Equivalently, `G` is well-generated
+        if `d_i + d_i^* = d_{\ell}` for all `1 \leq i \leq \ell`.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: C.is_well_generated()
+            True
+            sage: C = ColoredPermutations(2, 8)
+            sage: C.is_well_generated()
+            True
+            sage: C = ColoredPermutations(1, 4)
+            sage: C.is_well_generated()
+            True
+        """
+        if self._p not in [1, self._m]:
+            return False
+        deg = self.degrees()
+        codeg = self.codegrees()
+        return all(deg[-1] == d + dstar for d, dstar in zip(deg, codeg))
+
+    Element = ColoredPermutation
+
+
+class ColoredPermutations(ShephardToddFamilyGroup):
+    r"""
+    The group of `m`-colored permutations on `\{1, 2, \ldots, n\}`.
+
+    Let `S_n` be the symmetric group on `n` letters and `C_m` be the cyclic
+    group of order `m`. The `m`-colored permutation group on `n` letters
+    is given by `P_n^m = C_m \wr S_n`. This is also the complex reflection
+    group `G(m, 1, n)`.
+
+    We define our multiplication by
+
+    .. MATH::
+
+        ((s_1, \ldots s_n), \sigma) \cdot ((t_1, \ldots, t_n), \tau)
+        = ((s_1 t_{\sigma(1)}, \ldots, s_n t_{\sigma(n)}), \tau \sigma).
+
+    EXAMPLES::
+
+        sage: C = ColoredPermutations(4, 3); C
+        4-colored permutations of size 3
+        sage: s1,s2,t = C.gens()
+        sage: (s1, s2, t)
+        ([[0, 0, 0], [2, 1, 3]], [[0, 0, 0], [1, 3, 2]], [[0, 0, 1], [1, 2, 3]])
+        sage: s1*s2
+        [[0, 0, 0], [3, 1, 2]]
+        sage: s1*s2*s1 == s2*s1*s2
+        True
+        sage: t^4 == C.one()
+        True
+        sage: s2*t*s2
+        [[0, 1, 0], [1, 2, 3]]
+
+    We can also create a colored permutation by passing
+    an iterable consisting of tuples consisting of ``(color, element)``::
+
+        sage: x = C([(2,1), (3,3), (3,2)]); x
+        [[2, 3, 3], [1, 3, 2]]
+
+    or a list of colors and a permutation::
+
+        sage: C([[3,3,1], [1,3,2]])
+        [[3, 3, 1], [1, 3, 2]]
+        sage: C(([3,3,1], [1,3,2]))
+        [[3, 3, 1], [1, 3, 2]]
+
+    There is also the natural lift from permutations::
+
+        sage: P = Permutations(3)
+        sage: C(P.an_element())
+        [[0, 0, 0], [3, 1, 2]]
+
+    A colored permutation::
+
+        sage: C(C.an_element()) == C.an_element()
+        True
+
+    REFERENCES:
+
+    - :wikipedia:`Generalized_symmetric_group`
+    - :wikipedia:`Complex_reflection_group`
+    """
+    def __init__(self, m, n):
+        r"""
+        Initialize ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: TestSuite(C).run()
+            sage: C = ColoredPermutations(2, 3)
+            sage: TestSuite(C).run()
+            sage: C = ColoredPermutations(1, 3)
+            sage: TestSuite(C).run()
+        """
+        ShephardToddFamilyGroup.__init__(self, m, 1, n)
+
+    def _repr_(self):
+        """
+        Return a string representation of ``self``.
+
+        EXAMPLES::
+
+            sage: ColoredPermutations(4, 3)
+            4-colored permutations of size 3
+        """
+        return "{}-colored permutations of size {}".format(self._m, self._n)
+
+    def __iter__(self):
+        """
+        Iterate over ``self``.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(2, 2)
+            sage: [x for x in C]
+            [[[0, 0], [1, 2]],
+             [[0, 1], [1, 2]],
+             [[1, 0], [1, 2]],
+             [[1, 1], [1, 2]],
+             [[0, 0], [2, 1]],
+             [[0, 1], [2, 1]],
+             [[1, 0], [2, 1]],
+             [[1, 1], [2, 1]]]
+        """
+        for perm in self._P:
+            for c in itertools.product(self._C, repeat=self._n):
+                yield self.element_class(self, c, perm)
+
+
+#####################################################################
+#  Signed permutations
+
+
+class SignedPermutation(ColoredPermutation,
+                        metaclass=InheritComparisonClasscallMetaclass):
+    """
+    A signed permutation.
+    """
+    @staticmethod
+    def __classcall_private__(cls, pi):
+        """
+        Create a signed permutation.
+
+        EXAMPLES::
+
+            sage: SignedPermutation([2, 1, 3])
+            [2, 1, 3]
+
+            sage: SignedPermutation([2, 1, -3])
+            [2, 1, -3]
+
+            sage: SignedPermutation((2,1,-3))
+            [2, 1, -3]
+
+            sage: SignedPermutation(range(1,4))
+            [1, 2, 3]
+        """
+        return SignedPermutations(len(list(pi)))(pi)
+
+    def _repr_(self):
+        """
+        Return a string representation of ``self``.
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(4)
+            sage: s1,s2,s3,s4 = S.gens()
+            sage: s4*s1*s2*s3*s4
+            [-4, 1, 2, -3]
+        """
+        return repr(list(self))
+
+    _latex_ = _repr_
+
+    def _mul_(self, other):
+        """
+        Multiply ``self`` and ``other``.
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(4)
+            sage: s1,s2,s3,s4 = S.gens()
+            sage: x = s4*s1*s2*s3*s4; x
+            [-4, 1, 2, -3]
+            sage: x * x
+            [3, -4, 1, -2]
+
+        ::
+
+            sage: s1*s2*s1 == s1*s2*s1
+            True
+            sage: s3*s4*s3*s4 == s4*s3*s4*s3
+            True
+        """
+        colors = tuple(c * other._colors[val - 1]  # -1 for indexing
+                       for c, val in zip(self._colors, self._perm))
+        p = self._perm._left_to_right_multiply_on_right(other._perm)
+        return self.__class__(self.parent(), colors, p)
+
+    def __invert__(self):
+        """
+        Return the inverse of ``self``.
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(4)
+            sage: s1,s2,s3,s4 = S.gens()
+            sage: x = s4*s1*s2*s3*s4
+            sage: ~x   # indirect doctest
+            [2, 3, -4, -1]
+            sage: x * ~x == S.one()
+            True
+        """
+        ip = ~self._perm
+        return self.__class__(self.parent(),
+                              tuple(self._colors[i - 1] for i in ip),  # -1 for indexing
+                              ip)
+
+    def __iter__(self):
+        """
+        Iterate over ``self``.
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(4)
+            sage: s1,s2,s3,s4 = S.gens()
+            sage: x = s4*s1*s2*s3*s4
+            sage: [a for a in x]
+            [-4, 1, 2, -3]
+        """
+        for c, p in zip(self._colors, self._perm):
+            yield c * p
+
+    def __getitem__(self, key):
+        """
+        Return the specified element in the one line form of ``self``.
+
+        EXAMPLES::
+
+            sage: pi = SignedPermutation([-4, 5, -1, 2, -3])
+            sage: pi[-1]
+            -3
+            sage: pi[1::2]
+            [5, 2]
+        """
+        if isinstance(key, slice):
+            return [c * v for c, v in zip(self._colors[key], self._perm[key])]
+        return self._colors[key] * self._perm[key]
+
+    def __call__(self, i):
+        """
+        Return the image of the integer ``i`` in ``self``.
+
+        EXAMPLES::
+
+            sage: pi = SignedPermutations(7)([2,-1,4,-6,-5,-3,7])
+            sage: pi(2)
+            -1
+            sage: pi(-2)
+            1
+            sage: pi(7)
+            7
+            sage: pi(-7)
+            -7
+            sage: [pi(i) for i in range(1,8)]
+            [2, -1, 4, -6, -5, -3, 7]
+            sage: [pi(-i) for i in range(1,8)]
+            [-2, 1, -4, 6, 5, 3, -7]
+        """
+        if i in ZZ and 1 <= abs(i) <= len(self):
+            i = ZZ(i)
+            if i < 0:
+                return -self._colors[-i - 1] * self._perm[-i - 1]
+            return self._colors[i - 1] * self._perm[i - 1]
+
+        raise TypeError("i (= %s) must equal +/- an integer between %s and %s"
+                        % (i, 1, len(self)))
+
+    def to_matrix(self):
+        """
+        Return a matrix of ``self``.
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(4)
+            sage: s1,s2,s3,s4 = S.gens()
+            sage: x = s4*s1*s2*s3*s4
+            sage: M = x.to_matrix(); M                                                  # needs sage.modules
+            [ 0  1  0  0]
+            [ 0  0  1  0]
+            [ 0  0  0 -1]
+            [-1  0  0  0]
+
+        The matrix multiplication is in the *opposite* order::
+
+            sage: m1,m2,m3,m4 = [g.to_matrix() for g in S.gens()]                       # needs sage.modules
+            sage: M == m4 * m3 * m2 * m1 * m4                                           # needs sage.modules
+            True
+        """
+        return self._perm.to_matrix() * diagonal_matrix(self._colors)
+
+    def has_left_descent(self, i) -> bool:
+        """
+        Return ``True`` if ``i`` is a left descent of ``self``.
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(4)
+            sage: s1,s2,s3,s4 = S.gens()
+            sage: x = s4*s1*s2*s3*s4
+            sage: [x.has_left_descent(i) for i in S.index_set()]
+            [True, False, False, True]
+        """
+        n = self.parent()._n
+        if i == n:
+            return self._colors[-1] == -1
+        if self._colors[i - 1] == -1:
+            return self._colors[i] == 1 or self._perm[i - 1] < self._perm[i]
+        return self._colors[i] == 1 and self._perm[i - 1] > self._perm[i]
+
+    def to_cycles(self, singletons=True, use_min=True, negative_cycles=True):
+        r"""
+        Return the signed permutation ``self`` as a list of disjoint cycles.
+
+        The cycles are returned in the order of increasing smallest
+        elements, and each cycle is returned as a tuple which starts
+        with its smallest positive element.
+
+        INPUT:
+
+        - ``singletons`` -- boolean (default: ``True``); whether to include
+          singleton cycles or not
+        - ``use_min`` -- boolean (default: ``True``); if ``False``, the cycles
+          are returned in the order of increasing *largest* (not smallest)
+          elements, and each cycle starts with its largest element
+        - ``negative_cycles`` -- boolean (default: ``True``); if ``False``, for
+          any two cycles `C^{\pm} = \{\pm c_1, \ldots, \pm c_k\}` such that
+          `C^+ \neq C^-`, this does not include the cycle `C^-`
+
+        .. WARNING::
+
+            The argument ``negative_cycles`` does not refer to the usual
+            definition of a negative cycle; see :meth:`cycle_type`.
+
+        EXAMPLES::
+
+            sage: pi = SignedPermutations(7)([2,-1,4,-6,-5,-3,7])
+            sage: pi.to_cycles()
+            [(1, 2, -1, -2), (3, 4, -6), (-3, -4, 6), (5, -5), (7,), (-7,)]
+            sage: pi.to_cycles(singletons=False)
+            [(1, 2, -1, -2), (3, 4, -6), (-3, -4, 6), (5, -5)]
+            sage: pi.to_cycles(negative_cycles=False)
+            [(1, 2, -1, -2), (3, 4, -6), (5, -5), (7,)]
+            sage: pi.to_cycles(singletons=False, negative_cycles=False)
+            [(1, 2, -1, -2), (3, 4, -6), (5, -5)]
+            sage: pi.to_cycles(use_min=False)
+            [(7,), (-7,), (6, -3, -4), (-6, 3, 4), (5, -5), (2, -1, -2, 1)]
+            sage: pi.to_cycles(singletons=False, use_min=False)
+            [(6, -3, -4), (-6, 3, 4), (5, -5), (2, -1, -2, 1)]
+        """
+        cycles = []
+
+        l = self._perm[:]
+
+        if use_min:
+            groundset = range(len(l))
+        else:
+            groundset = reversed(range(len(l)))
+
+        # Go through until we've considered every number between 1 and len(l)
+        for i in groundset:
+            if not l[i]:
+                continue
+            cycle_first = i + 1
+            cycle = [cycle_first]
+            l[i], next_val = False, l[i]
+            s = self._colors[i]
+            add_neg = True
+            while next_val != cycle_first:
+                cycle.append(s * next_val)
+                s *= self._colors[next_val - 1]
+                l[next_val - 1], next_val = False, l[next_val - 1]
+            if s != 1:
+                cycle.extend([-e for e in cycle])
+                add_neg = False
+
+            # Add the cycle to the list of cycles
+            if singletons or len(cycle) > 1:
+                cycles.append(tuple(cycle))
+                if negative_cycles and add_neg:
+                    cycles.append(tuple([-e for e in cycle]))
+
+        return cycles
+
+    def cycle_type(self):
+        r"""
+        Return a pair of partitions of ``len(self)`` corresponding to the
+        signed cycle type of ``self``.
+
+        A *cycle* is a tuple `C = (c_0, \ldots, c_{k-1})` with
+        `\pi(c_i) = c_{i+1}` for `0 \leq i < k` and `\pi(c_{k-1}) = c_0`.
+        If `C` is a cycle, `\overline{C} = (-c_0, \ldots, -c_{k-1})` is
+        also a cycle. A cycle is *negative*, if `C = \overline{C}` up
+        to cyclic reordering. In this case, `k` is necessarily even
+        and the length of `C` is `k/2`. A *positive cycle* is a pair
+        `C \overline{C}`, its length is `k`.
+
+        Let `\alpha` be the partition whose parts are the lengths of the
+        positive cycles and let `\beta` be the partition whose parts are
+        the lengths of the negative cycles.  Then `(\alpha, \beta)` is
+        the cycle type of `\pi`.
+
+        EXAMPLES::
+
+            sage: G = SignedPermutations(7)
+            sage: pi = G([2, -1, 4, -6, -5, -3, 7])
+            sage: pi.cycle_type()
+            ([3, 1], [2, 1])
+
+            sage: G = SignedPermutations(5)
+            sage: all(pi.cycle_type().size() == 5 for pi in G)
+            True
+            sage: set(pi.cycle_type() for pi in G) == set(PartitionTuples(2, 5))        # needs sage.libs.flint
+            True
+        """
+        cycles = self.to_cycles(negative_cycles=False)
+        pos_cycles = []
+        neg_cycles = []
+        for C in cycles:
+            if (not len(C) % 2) and C[0] == -C[len(C)//2]:
+                neg_cycles.append(C)
+            else:
+                pos_cycles.append(C)
+        pos_type = [len(C) for C in pos_cycles]
+        pos_type.sort(reverse=True)
+        neg_type = [len(C) // 2 for C in neg_cycles]
+        neg_type.sort(reverse=True)
+        PT = PartitionTuples(2, self.parent()._n)
+        return PT([pos_type, neg_type])
+
+    def order(self):
+        """
+        Return the multiplicative order of the signed permutation.
+
+        EXAMPLES::
+
+            sage: pi = SignedPermutations(7)([2,-1,4,-6,-5,-3,7])
+            sage: pi.to_cycles(singletons=False)
+            [(1, 2, -1, -2), (3, 4, -6), (-3, -4, 6), (5, -5)]
+            sage: pi.order()
+            12
+        """
+        return lcm(len(c) for c in self.to_cycles(singletons=False, negative_cycles=False))
+
+
+class SignedPermutations(ColoredPermutations):
+    r"""
+    Group of signed permutations.
+
+    The group of signed permutations is also known as the hyperoctahedral
+    group, the Coxeter group of type `B_n`, and the 2-colored permutation
+    group. Thus it can be constructed as the wreath product `S_2 \wr S_n`.
+
+    EXAMPLES::
+
+        sage: S = SignedPermutations(4)
+        sage: s1,s2,s3,s4 = S.group_generators()
+        sage: x = s4*s1*s2*s3*s4; x
+        [-4, 1, 2, -3]
+        sage: x^4 == S.one()
+        True
+
+    This is a finite Coxeter group of type `B_n`::
+
+        sage: S.canonical_representation()                                              # needs sage.graphs sage.modules sage.rings.number_field
+        Finite Coxeter group over Number Field in a with defining polynomial x^2 - 2
+         with a = 1.414213562373095? with Coxeter matrix:
+        [1 3 2 2]
+        [3 1 3 2]
+        [2 3 1 4]
+        [2 2 4 1]
+        sage: S.long_element()
+        [-1, -2, -3, -4]
+        sage: S.long_element().reduced_word()
+        [1, 2, 1, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 4, 3, 4]
+
+    We can also go between the 2-colored permutation group::
+
+        sage: C = ColoredPermutations(2, 3)
+        sage: S = SignedPermutations(3)
+        sage: S.an_element()
+        [-3, 1, 2]
+        sage: C(S.an_element())
+        [[1, 0, 0], [3, 1, 2]]
+        sage: S(C(S.an_element())) == S.an_element()
+        True
+        sage: S(C.an_element())
+        [-3, 1, 2]
+
+    There is also the natural lift from permutations::
+
+        sage: P = Permutations(3)
+        sage: x = S(P.an_element()); x
+        [3, 1, 2]
+        sage: x.parent()
+        Signed permutations of 3
+
+    REFERENCES:
+
+    - :wikipedia:`Hyperoctahedral_group`
+    """
+    def __init__(self, n):
+        """
+        Initialize ``self``.
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(4)
+            sage: TestSuite(S).run()
+        """
+        ColoredPermutations.__init__(self, 2, n)
+
+    def _repr_(self):
+        """
+        Return a string representation of ``self``.
+
+        EXAMPLES::
+
+            sage: SignedPermutations(4)
+            Signed permutations of 4
+        """
+        return "Signed permutations of {}".format(self._n)
+
+    @cached_method
+    def one(self):
+        """
+        Return the identity element of ``self``.
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(4)
+            sage: S.one()
+            [1, 2, 3, 4]
+        """
+        return self.element_class(self, [ZZ.one()] * self._n,
+                                  self._P.identity())
+
+    def random_element(self):
+        """
+        Return an element drawn uniformly at random.
+
+        EXAMPLES::
+
+            sage: C = SignedPermutations(7)
+            sage: s = C.random_element(); s # random
+            [7, 6, -4, -5, 2, 3, -1]
+            sage: s in C
+            True
+        """
+        return self.element_class(self,
+                                  [choice([ZZ.one(), -ZZ.one()])
+                                   for _ in range(self._n)],
+                                  self._P.random_element())
+
+    def simple_reflection(self, i):
+        r"""
+        Return the ``i``-th simple reflection of ``self``.
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(4)
+            sage: S.simple_reflection(1)
+            [2, 1, 3, 4]
+            sage: S.simple_reflection(4)
+            [1, 2, 3, -4]
+        """
+        if i not in self.index_set():
+            raise ValueError("i must be in the index set")
+        if i < self._n:
+            p = list(range(1, self._n + 1))
+            p[i - 1] = i + 1
+            p[i] = i
+            return self.element_class(self, [ZZ.one()] * self._n, self._P(p))
+        temp = [ZZ.one()] * self._n
+        temp[-1] = -ZZ.one()
+        return self.element_class(self, temp, self._P.identity())
+
+    def _element_constructor_(self, x):
+        """
+        Construct an element of ``self`` from ``x``.
+
+        TESTS::
+
+            sage: S = SignedPermutations(3)
+            sage: x = S([(+1,1), (-1,3), (-1,2)]); x
+            [1, -3, -2]
+            sage: x == S([[+1,-1,-1], [1,3,2]])
+            True
+            sage: x == S([1, -3, -2])
+            True
+
+            sage: S = SignedPermutations(0)
+            sage: S([]) == list(S)[0]
+            True
+
+            sage: T = SignedPermutation(range(1,4))
+            sage: SignedPermutations(3)(T)
+            [1, 2, 3]
+        """
+        if isinstance(x, self.element_class) and x.parent() is self:
+            return self
+        x = list(x)
+        if x and isinstance(x[0], tuple):
+            c = []
+            p = []
+            for k in x:
+                if len(k) != 2:
+                    raise ValueError("input must be pairs (sign, element)")
+                if k[0] != 1 and k[0] != -1:
+                    raise ValueError("the sign must be +1 or -1")
+                c.append(ZZ(k[0]))
+                p.append(k[1])
+            return self.element_class(self, c, self._P(p))
+
+        if len(x) == self._n:
+            c = []
+            p = []
+            one = ZZ.one()
+            for v in x:
+                if v > 0:
+                    c.append(one)
+                    p.append(v)
+                else:
+                    c.append(-one)
+                    p.append(-v)
+            return self.element_class(self, c, self._P(p))
+
+        if len(x) != 2:
+            raise ValueError("input must be a pair of a list of signs and a permutation")
+        if any(s != 1 and s != -1 for s in x[0]):
+            raise ValueError("the sign must be +1 or -1")
+        return self.element_class(self, [ZZ(v) for v in x[0]], self._P(x[1]))
+
+    def __iter__(self):
+        """
+        Iterate over ``self``.
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(2)
+            sage: [x for x in S]
+            [[1, 2], [1, -2], [-1, 2], [-1, -2],
+             [2, 1], [2, -1], [-2, 1], [-2, -1]]
+        """
+        pmone = [ZZ.one(), -ZZ.one()]
+        for p in self._P:
+            for c in itertools.product(pmone, repeat=self._n):
+                yield self.element_class(self, c, p)
+
+    def _coerce_map_from_(self, C):
+        """
+        Return a coerce map from ``C`` if it exists and ``None`` otherwise.
+
+        EXAMPLES::
+
+            sage: C = ColoredPermutations(2, 3)
+            sage: S = SignedPermutations(3)
+            sage: S.has_coerce_map_from(C)
+            True
+
+            sage: C = ColoredPermutations(4, 3)
+            sage: S.has_coerce_map_from(C)
+            False
+
+            sage: P = Permutations(3)
+            sage: C.has_coerce_map_from(P)
+            True
+            sage: P = Permutations(4)
+            sage: C.has_coerce_map_from(P)
+            False
+        """
+        if isinstance(C, Permutations) and C.n == self._n:
+            return lambda P, x: P.element_class(P, [1] * P._n, x)
+        if isinstance(C, ColoredPermutations) and C._n == self._n and C._m == 2:
+            return lambda P, x: P.element_class(P,
+                                                [1 if v == 0 else -1
+                                                 for v in x._colors],
+                                                x._perm)
+        return super()._coerce_map_from_(C)
+
+    def tabloid_module(self, shape, base_ring):
+        """
+        Return the tabloid module of ``self`` with shape ``shape``
+        over ``base_ring``.
+
+        EXAMPLES::
+
+            sage: # needs sage.groups sage.modules
+            sage: B4 = SignedPermutations(4)
+            sage: TM = B4.tabloid_module([[2,1], [1]], GF(2))
+            sage: TM.dimension()
+            96
+            sage: TM = B4.tabloid_module([[], [3,1]], GF(2))
+            sage: TM.dimension()
+            4
+        """
+        from .colored_permutations_representations import TabloidModule
+        return TabloidModule(self, base_ring, shape)
+
+    def specht_module(self, shape, base_ring):
+        """
+        Return the Specht module of ``self`` with shape ``shape``
+        over ``base_ring``.
+
+        EXAMPLES::
+
+            sage: # needs sage.groups sage.modules
+            sage: B4 = SignedPermutations(4)
+            sage: SM = B4.specht_module([[2,1], [1]], GF(2))
+            sage: SM.dimension()
+            8
+            sage: SM = B4.specht_module([[], [3,1]], GF(2))
+            sage: SM.dimension()
+            3
+        """
+        return self.tabloid_module(shape, base_ring).specht_module()
+
+    def simple_module(self, shape, base_ring):
+        """
+        Return the simple module of ``self`` with shape ``shape``
+        over ``base_ring``.
+
+        EXAMPLES::
+
+            sage: # needs sage.groups sage.modules
+            sage: B4 = SignedPermutations(4)
+            sage: L = B4.simple_module([[], [3,1]], GF(2))
+            sage: L.dimension()
+            2
+        """
+        return self.specht_module(shape, base_ring).simple_module()
+
+    def long_element(self, index_set=None):
+        """
+        Return the longest element of ``self``, or of the
+        parabolic subgroup corresponding to the given ``index_set``.
+
+        INPUT:
+
+        - ``index_set`` -- (optional) a subset (as a list or iterable)
+          of the nodes of the indexing set
+
+        EXAMPLES::
+
+            sage: S = SignedPermutations(4)
+            sage: S.long_element()
+            [-1, -2, -3, -4]
+
+        TESTS:
+
+        Check that this is the element of maximal length (:issue:`25200`)::
+
+            sage: S = SignedPermutations(4)
+            sage: S.long_element().length() == max(x.length() for x in S)
+            True
+            sage: all(SignedPermutations(n).long_element().length() == n^2
+            ....:     for n in range(2,10))
+            True
+        """
+        if index_set is not None:
+            return super().long_element()
+        return self.element_class(self, [-ZZ.one()] * self._n, self._P.one())
+
+    def conjugacy_class(self, g):
+        r"""
+        Return the conjugacy class of ``g`` in ``self``.
+
+        INPUT:
+
+        - ``g`` -- a pair of partitions or an element of ``self``
+
+        EXAMPLES::
+
+            sage: # needs sage.groups sage.modules
+            sage: G = SignedPermutations(5)
+            sage: g = G([1,-3,2,5,-4])
+            sage: G.conjugacy_class(g)
+            Conjugacy class of cycle type ([1], [2, 2]) in Signed permutations of 5
+            sage: G.conjugacy_class([[2,1], [1,1]])
+            Conjugacy class of cycle type ([2, 1], [1, 1]) in Signed permutations of 5
+        """
+        from .colored_permutations_representations import SignedPermutationGroupConjugacyClass
+        return SignedPermutationGroupConjugacyClass(self, g)
+
+    def conjugacy_classes(self):
+        """
+        Return the list of conjugacy classes of ``self``.
+
+        EXAMPLES::
+
+            sage: # needs sage.libs.flint
+            sage: G = SignedPermutations(3)
+            sage: G.conjugacy_classes()
+            [Conjugacy class of cycle type ([3], []) in Signed permutations of 3,
+             Conjugacy class of cycle type ([2, 1], []) in Signed permutations of 3,
+             Conjugacy class of cycle type ([1, 1, 1], []) in Signed permutations of 3,
+             Conjugacy class of cycle type ([2], [1]) in Signed permutations of 3,
+             Conjugacy class of cycle type ([1, 1], [1]) in Signed permutations of 3,
+             Conjugacy class of cycle type ([1], [2]) in Signed permutations of 3,
+             Conjugacy class of cycle type ([1], [1, 1]) in Signed permutations of 3,
+             Conjugacy class of cycle type ([], [3]) in Signed permutations of 3,
+             Conjugacy class of cycle type ([], [2, 1]) in Signed permutations of 3,
+             Conjugacy class of cycle type ([], [1, 1, 1]) in Signed permutations of 3]
+        """
+        return [self.conjugacy_class(la) for la in PartitionTuples(2, self._n)]
+
+    def conjugacy_class_representative(self, nu):
+        r"""
+        Return a permutation with (signed) cycle type ``nu``.
+
+        EXAMPLES::
+
+            sage: G = SignedPermutations(4)
+            sage: for nu in PartitionTuples(2, 4):                                      # needs sage.libs.flint
+            ....:     print(nu, G.conjugacy_class_representative(nu))
+            ....:     assert nu == G.conjugacy_class_representative(nu).cycle_type(), nu
+            ([4], []) [2, 3, 4, 1]
+            ([3, 1], []) [2, 3, 1, 4]
+            ([2, 2], []) [2, 1, 4, 3]
+            ([2, 1, 1], []) [2, 1, 3, 4]
+            ([1, 1, 1, 1], []) [1, 2, 3, 4]
+            ([3], [1]) [2, 3, 1, -4]
+            ([2, 1], [1]) [2, 1, 3, -4]
+            ([1, 1, 1], [1]) [1, 2, 3, -4]
+            ([2], [2]) [2, 1, 4, -3]
+            ([2], [1, 1]) [2, 1, -3, -4]
+            ([1, 1], [2]) [1, 2, 4, -3]
+            ([1, 1], [1, 1]) [1, 2, -3, -4]
+            ([1], [3]) [1, 3, 4, -2]
+            ([1], [2, 1]) [1, 3, -2, -4]
+            ([1], [1, 1, 1]) [1, -2, -3, -4]
+            ([], [4]) [2, 3, 4, -1]
+            ([], [3, 1]) [2, 3, -1, -4]
+            ([], [2, 2]) [2, -1, 4, -3]
+            ([], [2, 1, 1]) [2, -1, -3, -4]
+            ([], [1, 1, 1, 1]) [-1, -2, -3, -4]
+
+        TESTS::
+
+            sage: all(nu == SignedPermutations(n).conjugacy_class_representative(nu).cycle_type()   # needs sage.libs.flint
+            ....:     for n in range(1, 6) for nu in PartitionTuples(2, n))
+            True
+        """
+        nu = PartitionTuples(2, self._n)(nu)
+        la, mu = nu
+        cyc = []
+        cnt = 0
+
+        for i in la:
+            cyc += [tuple(range(cnt+1, cnt+i+1))] + [tuple(range(-cnt-1, -cnt-i-1, -1))]
+            cnt += i
+        for i in mu:
+            cyc += [tuple(range(cnt+1, cnt+i+1)) + tuple(range(-cnt-1, -cnt-i-1, -1))]
+            cnt += i
+
+        p = [None] * self._n
+        for c in cyc:
+            for i in range(len(c)-1):
+                if c[i] > 0:
+                    p[c[i]-1] = c[i+1]
+            if c[-1] > 0:
+                p[c[-1]-1] = c[0]
+
+        return self(p)
+
+    Element = SignedPermutation
+
+# TODO: Make this a subgroup
+# class EvenSignedPermutations(SignedPermutations):
+#    """
+#    Group of even signed permutations.
+#    """
+#    def _repr_(self):
+#        """
+#        Return a string representation of ``self``.
+#        """
+#        return "Even signed permutations of {}".format(self._n)
+#
+#    def __iter__(self):
+#        """
+#        Iterate over ``self``.
+#        """
+#        for s in SignedPermutations.__iter__(self):
+#            total = 0
+#            for pm in s._colors:
+#                if pm == -1:
+#                    total += 1
+#
+#            if total % 2 == 0:
+#                yield s
+
+# Conjugacy classes, representation theory moved to colored_permutations_representations.py