passagemath-gap-pkg-semigroups 10.6.29__cp312-abi3-manylinux_2_24_x86_64.manylinux_2_28_x86_64.whl

gap/pkg/semigroups/gap/greens/acting-regular.gi

@@ -0,0 +1,553 @@
+#############################################################################
+##
+##  greens/acting-regular.gi
+##  Copyright (C) 2013-2022                              James D. Mitchell
+##
+##  Licensing information can be found in the README file of this package.
+##
+#############################################################################
+##
+
+## This file contains methods for Green's classes of regular acting semigroups.
+
+# See the start of greens/acting.gi for details of how to create Green's
+# classes of acting semigroups.
+
+# There are two types of methods here, those for IsRegularGreensClass (i.e.
+# those Green's classes containing an idempotent) and those for
+# IsRegularActingRepGreensClass (i.e. those that are known from the point of
+# creation that they belong to a regular semigroup, which knew from its point
+# of creation that it was regular).
+
+#############################################################################
+## This file contains methods for Green's classes etc for acting semigroups.
+## It is organized as follows:
+##
+##   1. Helper functions for the creation of Green's classes, and lambda-rho
+##      stuff.
+##
+##   2. Individual Green's classes (constructors, size, membership)
+##
+##   3. Collections of Green's classes (GreensXClasses, XClassReps, NrXClasses)
+##
+##   4. Idempotents and NrIdempotents
+##
+##   5. Regularity of Green's classes
+##
+##   6. Iterators and enumerators
+##
+#############################################################################
+
+#############################################################################
+## 1. Helper functions for the creation of Green's classes . . .
+#############################################################################
+
+InstallMethod(RhoCosets, "for a regular class of an acting semigroup",
+[IsRegularActingRepGreensClass],
+function(C)
+  local S;
+  S := Parent(C);
+  return [LambdaIdentity(S)(LambdaRank(S)(LambdaFunc(S)(C!.rep)))];
+end);
+
+InstallMethod(LambdaCosets, "for a regular class of an acting semigroup",
+[IsRegularActingRepGreensClass], RhoCosets);
+
+# same method for inverse
+
+InstallMethod(SchutzenbergerGroup, "for D-class of regular acting semigroup",
+[IsGreensDClass and IsRegularActingRepGreensClass],
+D -> LambdaOrbSchutzGp(LambdaOrb(D), LambdaOrbSCCIndex(D)));
+
+# same method for inverse
+
+InstallMethod(SchutzenbergerGroup,
+"for H-class of regular acting semigroup rep",
+[IsRegularActingRepGreensClass and IsGreensHClass],
+function(H)
+  local o, i, m, rep, p;
+
+  o := LambdaOrb(H);
+  i := Position(o, LambdaFunc(Parent(H))(H!.rep));
+  m := LambdaOrbSCCIndex(H);
+  rep := H!.rep;
+  if i <> OrbSCC(o)[m][1] then
+    rep := rep * LambdaOrbMult(o, m, i)[2];
+  fi;
+
+  p := LambdaConjugator(Parent(H))(rep, H!.rep);
+  return LambdaOrbSchutzGp(LambdaOrb(H), LambdaOrbSCCIndex(H)) ^ p;
+end);
+
+# The following methods (for \< for Green's classes) should not be applied to
+# IsRegularGreensClass since they rely on the fact that these are Green's
+# classes of a regular semigroup, which uses the data structures of semigroup
+# that knew it was regular from the point of creation.
+
+# Same method for inverse
+
+InstallMethod(\<,
+"for Green's D-classes of a regular acting semigroup rep",
+[IsGreensDClass and IsRegularActingRepGreensClass,
+ IsGreensDClass and IsRegularActingRepGreensClass],
+function(x, y)
+  local S, scc;
+  if Parent(x) <> Parent(y) or x = y then
+    return false;
+  fi;
+  S    := Parent(x);
+  scc  := OrbSCCLookup(LambdaOrb(S));
+  return scc[Position(LambdaOrb(S), LambdaFunc(S)(x!.rep))]
+         < scc[Position(LambdaOrb(S), LambdaFunc(S)(y!.rep))];
+end);
+
+# Same method for inverse
+
+InstallMethod(\<,
+"for Green's R-classes of a regular acting semigroup rep",
+[IsGreensRClass and IsRegularActingRepGreensClass,
+ IsGreensRClass and IsRegularActingRepGreensClass],
+function(x, y)
+  if Parent(x) <> Parent(y) or x = y then
+    return false;
+  fi;
+  return RhoFunc(Parent(x))(x!.rep) < RhoFunc(Parent(x))(y!.rep);
+end);
+
+# Same method for inverse
+
+InstallMethod(\<,
+"for Green's L-classes of a regular acting semigroup rep",
+[IsGreensLClass and IsRegularActingRepGreensClass,
+ IsGreensLClass and IsRegularActingRepGreensClass],
+function(x, y)
+  if Parent(x) <> Parent(y) or x = y then
+    return false;
+  fi;
+  return LambdaFunc(Parent(x))(x!.rep) < LambdaFunc(Parent(x))(y!.rep);
+end);
+
+#############################################################################
+## 2. Individual classes . . .
+#############################################################################
+
+InstallMethod(Size, "for a regular D-class of an acting semigroup",
+[IsGreensDClass and IsRegularActingRepGreensClass],
+function(D)
+  return Size(SchutzenbergerGroup(D))
+         * Length(LambdaOrbSCC(D))
+         * Length(RhoOrbSCC(D));
+end);
+
+#############################################################################
+## 3. Collections of classes, and reps
+#############################################################################
+
+# different method for inverse.
+
+# Note that these are not rectified!
+
+# this method could apply to regular ideals but is not used since the rank of
+# IsActingSemigroup and IsSemigroupIdeal is higher than the rank for this
+# method. Anyway the data of an ideal must be enumerated to the end to know the
+# DClassReps, and to know the LambdaOrb, so these methods are equal.
+
+# Do not use the following method for IsRegularSemigroup, in case a semigroup
+# learns it is regular after it is created, since the order of the D-class reps
+# and D-classes might be important and should not change depending on what the
+# semigroup learns about itself.
+
+InstallMethod(DClassReps,
+"for a regular acting semigroup rep with generators",
+[IsRegularActingSemigroupRep and HasGeneratorsOfSemigroup],
+function(S)
+  local o, out, m;
+  o := LambdaOrb(S);
+  out := EmptyPlist(Length(OrbSCC(o)));
+  for m in [2 .. Length(OrbSCC(o))] do
+    out[m - 1] := ConvertToExternalElement(S, LambdaOrbRep(o, m));
+  od;
+  return out;
+end);
+
+# different method for inverse/ideals
+
+# Do not use the following method for IsRegularSemigroup, in case a semigroup
+# learns it is regular after it is created, since the order of the D-class reps
+# and D-classes might be important and should not change depending on what the
+# semigroup learns about itself.
+
+InstallMethod(GreensDClasses,
+"for a regular acting semigroup rep with generators",
+[IsRegularActingSemigroupRep and HasGeneratorsOfSemigroup],
+function(S)
+  local o, scc, out, SetRho, RectifyRho, rep, D, i;
+
+  o := LambdaOrb(S);
+  scc := OrbSCC(o);
+  out := EmptyPlist(Length(scc) - 1);
+  Enumerate(RhoOrb(S));
+  SetRho := SEMIGROUPS.SetRho;
+  RectifyRho := SEMIGROUPS.RectifyRho;
+  for i in [2 .. Length(scc)] do
+    # don't use GreensDClassOfElementNC here to avoid rectifying lambda
+    rep := ConvertToExternalElement(S, LambdaOrbRep(o, i));
+    D := SEMIGROUPS.CreateDClass(S, rep, false);
+    SetLambdaOrb(D, o);
+    SetLambdaOrbSCCIndex(D, i);
+    SetRho(D);
+    RectifyRho(D);
+    out[i - 1] := D;
+  od;
+  return out;
+end);
+
+# same method for inverse/ideals
+
+# Do not use the following method for IsRegularSemigroup, in case a semigroup
+# learns it is regular after it is created, since the order of the D-class reps
+# and D-classes might be important and should not change depending on what the
+# semigroup learns about itself.
+
+InstallMethod(RClassReps,
+"for a regular acting semigroup rep",
+[IsRegularActingSemigroupRep],
+S -> Concatenation(List(GreensDClasses(S), RClassReps)));
+
+# same method for inverse/ideals
+
+# Do not use the following method for IsRegularSemigroup, in case a semigroup
+# learns it is regular after it is created, since the order of the D-class reps
+# and D-classes might be important and should not change depending on what the
+# semigroup learns about itself.
+
+InstallMethod(GreensRClasses, "for a regular acting semigroup rep",
+[IsRegularActingSemigroupRep],
+S -> Concatenation(List(GreensDClasses(S), GreensRClasses)));
+
+#############################################################################
+
+# same method for inverse/ideals
+
+InstallMethod(NrDClasses, "for a regular acting semigroup with generators",
+[IsActingSemigroup and IsRegularSemigroup and HasGeneratorsOfSemigroup],
+S -> Length(OrbSCC(LambdaOrb(S))) - 1);
+
+# same method for inverse semigroups, same for ideals
+
+InstallMethod(NrLClasses, "for a regular acting semigroup",
+[IsActingSemigroup and IsRegularSemigroup],
+S -> Length(Enumerate(LambdaOrb(S))) - 1);
+
+# same method for inverse semigroups
+
+InstallMethod(NrLClasses, "for a D-class of regular acting semigroup",
+[IsActingSemigroupGreensClass and IsRegularDClass],
+D -> Length(LambdaOrbSCC(D)));
+
+# different method for inverse semigroups, same for ideals
+
+InstallMethod(NrRClasses, "for a regular acting semigroup",
+[IsActingSemigroup and IsRegularSemigroup],
+S -> Length(Enumerate(RhoOrb(S))) - 1);
+
+# different method for inverse semigroups
+
+InstallMethod(NrRClasses, "for a D-class of regular acting semigroup",
+[IsActingSemigroupGreensClass and IsRegularDClass],
+D -> Length(RhoOrbSCC(D)));
+
+# different method for inverse semigroups
+
+InstallMethod(NrHClasses, "for a D-class of regular acting semigroup",
+[IsActingSemigroupGreensClass and IsRegularDClass],
+R -> Length(LambdaOrbSCC(R)) * Length(RhoOrbSCC(R)));
+
+# different method for inverse semigroups
+
+InstallMethod(NrHClasses, "for a L-class of regular acting semigroup",
+[IsActingSemigroupGreensClass and IsRegularGreensClass and IsGreensLClass],
+L -> Length(RhoOrbSCC(L)));
+
+# same method for inverse semigroups
+
+InstallMethod(NrHClasses, "for a R-class of regular acting semigroup",
+[IsActingSemigroupGreensClass and IsRegularGreensClass and IsGreensRClass],
+R -> Length(LambdaOrbSCC(R)));
+
+# different method for inverse/ideals
+
+# Do not use the following method for IsRegularSemigroup, in case a semigroup
+# learns it is regular after it is created, since the order of the D-class reps
+# and D-classes might be important and should not change depending on what the
+# semigroup learns about itself.
+
+InstallMethod(PartialOrderOfDClasses,
+"for a regular acting semigroup rep with generators",
+[IsRegularActingSemigroupRep and HasGeneratorsOfSemigroup],
+function(S)
+  local D, n, out, o, gens, lookup, lambdafunc, i, x, y;
+
+  D := GreensDClasses(S);
+  n := Length(D);
+  out := List([1 .. n], x -> EmptyPlist(n));
+  o := LambdaOrb(S);
+  gens := o!.gens;
+  lookup := OrbSCCLookup(o);
+  lambdafunc := LambdaFunc(S);
+
+  for i in [1 .. n] do
+    for x in gens do
+      for y in RClassReps(D[i]) do
+        y := ConvertToInternalElement(S, y);
+        AddSet(out[i], lookup[Position(o, lambdafunc(x * y))] - 1);
+      od;
+      for y in LClassReps(D[i]) do
+        y := ConvertToInternalElement(S, y);
+        AddSet(out[i], lookup[Position(o, lambdafunc(y * x))] - 1);
+      od;
+    od;
+  od;
+  Perform(out, ShrinkAllocationPlist);
+  D := DigraphNC(IsMutableDigraph, out);
+  DigraphRemoveLoops(D);
+  MakeImmutable(D);
+  return D;
+end);
+
+#############################################################################
+## 4. Idempotents . . .
+#############################################################################
+
+# different method for inverse, same for ideals
+
+InstallMethod(NrIdempotents, "for a regular acting semigroup",
+[IsRegularSemigroup and IsActingSemigroup],
+function(S)
+  local nr, tester, rho_o, scc, lambda_o, rhofunc, lookup, rep, rho, j, i, k;
+
+  nr       := 0;
+  tester   := IdempotentTester(S);
+  rho_o    := RhoOrb(S);
+  scc      := OrbSCC(rho_o);
+  lambda_o := Enumerate(LambdaOrb(S));
+  rhofunc  := RhoFunc(S);
+  lookup   := OrbSCCLookup(rho_o);
+
+  for i in [2 .. Length(lambda_o)] do
+    # TODO(later) this could be better, just multiply by next element of the
+    # Schreier tree
+    rep := EvaluateWord(lambda_o, TraceSchreierTreeForward(lambda_o, i));
+    rho := rhofunc(rep);
+    j := lookup[Position(rho_o, rho)];
+    for k in scc[j] do
+      if tester(lambda_o[i], rho_o[k]) then
+        nr := nr + 1;
+      fi;
+    od;
+  od;
+
+  return nr;
+end);
+
+InstallMethod(NrIdempotents, "for a regular acting *-semigroup",
+[IsRegularStarSemigroup and IsActingSemigroup],
+function(S)
+  local nr, tester, o, scc, vals, x, i, j, k;
+
+  nr     := 0;
+  tester := IdempotentTester(S);
+  o      := Enumerate(LambdaOrb(S));
+  scc    := OrbSCC(o);
+
+  for i in [2 .. Length(scc)] do
+    vals := scc[i];
+    for j in [1 .. Length(vals)] do
+      nr := nr + 1;
+      x  := o[vals[j]];
+      for k in [j + 1 .. Length(vals)] do
+        if tester(x, o[vals[k]]) then
+          nr := nr + 2;
+        fi;
+      od;
+    od;
+  od;
+  return nr;
+end);
+
+# TODO(later) remove this method or find an example where it actually applies
+
+InstallMethod(NrIdempotents, "for a regular star bipartition acting semigroup",
+[IsRegularStarSemigroup and IsActingSemigroup and IsBipartitionSemigroup and
+ HasGeneratorsOfSemigroup],
+function(S)
+  if Length(Enumerate(LambdaOrb(S))) > 5000 then
+    return Sum(NrIdempotentsByRank(S));
+  fi;
+  TryNextMethod();
+end);
+
+# TODO(later) methods NrIdempotentsByRank for other types of semigroup.
+
+InstallMethod(NrIdempotentsByRank,
+"for a regular star bipartition acting semigroup",
+[IsRegularStarSemigroup and IsActingSemigroup and IsBipartitionSemigroup and
+ HasGeneratorsOfSemigroup],
+function(S)
+  local o, opts;
+  if DegreeOfBipartitionSemigroup(S) = 0 then
+    return [1];
+  fi;
+  o := Enumerate(LambdaOrb(S));
+  opts := SEMIGROUPS.OptionsRec(S);
+  return BIPART_NR_IDEMPOTENTS(o,
+                               OrbSCC(o),
+                               OrbSCCLookup(o),
+                               opts.nr_threads);
+end);
+
+#############################################################################
+## 5. Regular classes . . .
+#############################################################################
+
+# same method for inverse semigroups, same for ideals
+
+InstallMethod(NrRegularDClasses, "for a regular acting semigroup",
+[IsActingSemigroup and IsRegularSemigroup], NrDClasses);
+
+#############################################################################
+## 6. Iterators and enumerators . . .
+#############################################################################
+
+#############################################################################
+## 6.a. for all classes
+#############################################################################
+
+# same method for inverse
+
+InstallMethod(IteratorOfDClasses, "for a regular acting semigroup",
+[IsActingSemigroup and IsRegularSemigroup],
+function(S)
+  local record;
+
+  if HasGreensDClasses(S) then
+    return IteratorList(GreensDClasses(S));
+  fi;
+
+  record          := rec();
+  record.parent   := S;
+
+  return WrappedIterator(IteratorOfDClassReps(S),
+                         {iter, x} -> GreensDClassOfElementNC(iter!.parent, x),
+                         record);
+end);
+
+# different method for inverse
+
+InstallMethod(IteratorOfRClassReps, "for regular acting semigroup",
+[IsActingSemigroup and IsRegularSemigroup],
+function(S)
+  local o, func;
+
+  if HasRClassReps(S) then
+    return IteratorList(RClassReps(S));
+  fi;
+
+  o := Enumerate(RhoOrb(S));
+
+  # TODO(later): shouldn't o  be stored in iter!?
+  func := function(_, i)
+    # <rep> has rho val corresponding to <i>
+    # <rep> has lambda val in position 1 of GradedLambdaOrb(S, rep, false).
+    # We don't rectify the lambda val of <rep> in <o> since we require to
+    # enumerate LambdaOrb(S) to do this, if we use GradedLambdaOrb(S, rep,
+    # true) then this gets more complicated.
+    return ConvertToExternalElement(S,
+      EvaluateWord(o, Reversed(TraceSchreierTreeForward(o, i))));
+  end;
+
+  return WrappedIterator(IteratorList([2 .. Length(o)]), func);
+end);
+
+# same method for inverse
+
+InstallMethod(IteratorOfDClassReps, "for a regular acting semigroup",
+[IsActingSemigroup and IsRegularSemigroup],
+function(S)
+  local o, scc, func;
+
+  if HasDClassReps(S) then
+    return IteratorList(DClassReps(S));
+  fi;
+
+  o   := Enumerate(LambdaOrb(S));
+  scc := OrbSCC(o);
+
+  # TODO(later): shouldn't o and scc be stored in iter!?
+  func := function(_, m)
+    # has rectified lambda val and rho val!
+    return ConvertToExternalElement(S,
+      EvaluateWord(o, TraceSchreierTreeForward(o, scc[m][1])));
+  end;
+
+  return WrappedIterator(IteratorList([2 .. Length(scc)]), func);
+end);
+
+########################################################################
+# 7.b. for individual classes
+########################################################################
+
+# different method for inverse
+
+InstallMethod(Enumerator, "for a regular D-class of an acting semigroup",
+[IsGreensDClass and IsRegularActingRepGreensClass],
+function(D)
+  local convert_out, convert_in, rho_scc, lambda_scc, enum;
+
+  convert_out := function(enum, tuple)
+    local D, S, act, result;
+
+    if tuple = fail then
+      return fail;
+    fi;
+    D   := enum!.parent;
+    S   := Parent(D);
+    act := StabilizerAction(S);
+    result := RhoOrbMult(RhoOrb(D), RhoOrbSCCIndex(D), tuple[1])[1]
+              * D!.rep;
+    result := act(result, tuple[2]) * LambdaOrbMult(LambdaOrb(D),
+                                                    LambdaOrbSCCIndex(D),
+                                                    tuple[3])[1];
+    return ConvertToExternalElement(S, result);
+  end;
+
+  convert_in := function(enum, elt)
+    local D, S, k, l, f;
+
+    D := enum!.parent;
+    S := Parent(D);
+    elt := ConvertToInternalElement(S, elt);
+    k := Position(RhoOrb(D), RhoFunc(S)(elt));
+    if k = fail or OrbSCCLookup(RhoOrb(D))[k] <> RhoOrbSCCIndex(D) then
+      return fail;
+    fi;
+
+    l := Position(LambdaOrb(D), LambdaFunc(S)(elt));
+
+    if l = fail or OrbSCCLookup(LambdaOrb(D))[l] <> LambdaOrbSCCIndex(D) then
+      return fail;
+    fi;
+
+    f := RhoOrbMult(RhoOrb(D), RhoOrbSCCIndex(D), k)[2] * elt
+     * LambdaOrbMult(LambdaOrb(D), LambdaOrbSCCIndex(D), l)[2];
+
+    return [k, LambdaPerm(S)(D!.rep, f), l];
+  end;
+
+  rho_scc    := OrbSCC(RhoOrb(D))[RhoOrbSCCIndex(D)];
+  lambda_scc := OrbSCC(LambdaOrb(D))[LambdaOrbSCCIndex(D)];
+  enum := EnumeratorOfCartesianProduct(rho_scc,
+                                       SchutzenbergerGroup(D),
+                                       lambda_scc);
+  return WrappedEnumerator(D, enum, convert_out, convert_in);
+end);

gap/pkg/semigroups/gap/greens/acting.gd

@@ -0,0 +1,81 @@
+#############################################################################
+##
+##  greens/acting.gd
+##  Copyright (C) 2013-2022                              James D. Mitchell
+##
+##  Licensing information can be found in the README file of this package.
+##
+#############################################################################
+
+# Green's relations, classes, etc for acting semigroups.
+
+# The category IsInverseActingRepGreensClass should not be a property.  The
+# reason is that if a Green's D-class is not created as an InverseOpClass, then
+# its rep is rectified wrt Lambda and Rho, but if it is subsequently considered
+# as an InverseOpClass, then the Rho value of the rep will be wrong (i.e. not
+# nec. in the first position of the scc of the LambdaOrb containing its
+# Rho-value, but in the first position of the scc of the RhoOrb containing it).
+# Lots of methods in this file use the fact that the rep of an inverse-op
+# D-class has the representative with Lambda and Rho values in the first
+# position of the scc of the *LambdaOrb* containing them.  The same comments
+# apply to inverse-op L-classes, their reps must have their Rho value in the
+# first pos of the scc of the *LambdaOrb* containing the Rho value. So, an
+# L-class created as a non-inverse-op class, which later becomes an inverse-op
+# class will have the wrong representative. Therefore we don't allow classes to
+# change from non-inverse-op to inverse-op.
+
+DeclareCategory("IsActingSemigroupGreensClass",
+                IsGreensClassOfSemigroupThatCanUseFroidurePinRep);
+
+DeclareCategory("IsRegularActingRepGreensClass", IsActingSemigroupGreensClass);
+DeclareCategory("IsInverseActingRepGreensClass", IsRegularActingRepGreensClass);
+
+InstallTrueMethod(IsRegularGreensClass,
+                  IsRegularActingRepGreensClass and IsGreensDClass);
+InstallTrueMethod(IsRegularGreensClass,
+                  IsRegularActingRepGreensClass and IsGreensRClass);
+InstallTrueMethod(IsRegularGreensClass,
+                  IsRegularActingRepGreensClass and IsGreensLClass);
+
+DeclareAttribute("LambdaOrb", IsActingSemigroupGreensClass, "mutable");
+DeclareAttribute("RhoOrb", IsActingSemigroupGreensClass, "mutable");
+
+DeclareAttribute("LambdaOrbSCC", IsActingSemigroupGreensClass);
+DeclareAttribute("LambdaOrbSCCIndex", IsActingSemigroupGreensClass);
+
+DeclareAttribute("RhoOrbSCC", IsActingSemigroupGreensClass);
+DeclareAttribute("RhoOrbSCCIndex", IsActingSemigroupGreensClass);
+
+DeclareAttribute("LambdaCosets", IsActingSemigroupGreensClass);
+DeclareAttribute("RhoCosets", IsActingSemigroupGreensClass);
+DeclareAttribute("RhoOrbStabChain", IsActingSemigroupGreensClass);
+
+DeclareAttribute("SemigroupDataIndex", IsActingSemigroupGreensClass);
+
+DeclareOperation("GreensDClassOfElementNC",
+                 [IsActingSemigroup, IsMultiplicativeElement, IsBool]);
+DeclareOperation("GreensLClassOfElementNC",
+                 [IsActingSemigroup, IsMultiplicativeElement, IsBool]);
+DeclareOperation("GreensRClassOfElementNC",
+                 [IsActingSemigroup, IsMultiplicativeElement, IsBool]);
+DeclareOperation("GreensHClassOfElementNC",
+                 [IsActingSemigroup, IsMultiplicativeElement, IsBool]);
+
+DeclareOperation("GreensDClassOfElementNC",
+                 [IsGreensClass, IsMultiplicativeElement, IsBool]);
+DeclareOperation("GreensLClassOfElementNC",
+                 [IsGreensClass, IsMultiplicativeElement, IsBool]);
+DeclareOperation("GreensRClassOfElementNC",
+                 [IsGreensClass, IsMultiplicativeElement, IsBool]);
+DeclareOperation("GreensHClassOfElementNC",
+                 [IsGreensClass, IsMultiplicativeElement, IsBool]);
+
+DeclareOperation("IteratorOfDClasses", [IsSemigroup]);
+DeclareOperation("IteratorOfRClasses", [IsSemigroup]);
+
+DeclareOperation("IteratorOfDClassReps", [IsSemigroup]);
+DeclareOperation("IteratorOfRClassReps", [IsSemigroup]);
+
+DeclareOperation("RelativeDClassReps", [IsActingSemigroup, IsActingSemigroup]);
+DeclareOperation("RelativeLClassReps", [IsActingSemigroup, IsActingSemigroup]);
+DeclareOperation("RelativeRClassReps", [IsActingSemigroup, IsActingSemigroup]);