passagemath-gap-pkg-semigroups 10.6.29__cp312-abi3-musllinux_1_2_aarch64.whl

gap/pkg/semigroups/gap/elements/boolmat.gi

@@ -0,0 +1,726 @@
+############################################################################
+##
+##  elements/boolmat.gi
+##  Copyright (C) 2015-2022                              James D. Mitchell
+##
+##  Licensing information can be found in the README file of this package.
+##
+#############################################################################
+##
+
+# This file contains an implementation of boolean matrices.
+
+# A boolean matrix <mat> is a positional object where mat![i] is the i-th row
+# of the matrix, and it is a blist in blist rep.
+
+#############################################################################
+## Internal
+#############################################################################
+
+SEMIGROUPS.HashFunctionBooleanMat := function(x, data)
+  local n, h, i, j;
+
+  n := Length(x![1]);
+  h := 0;
+  for i in [1 .. n] do
+    for j in [1 .. n] do
+      if x![i][j] then
+        h := ((h * 2) + 1) mod data;
+      else
+        h := (h * 2) mod data;
+      fi;
+    od;
+  od;
+  return h + 1;
+end;
+
+SEMIGROUPS.SetBooleanMat := function(x)
+  local n, out, i;
+  n := Length(x![1]);
+  out := EmptyPlist(n);
+  for i in [1 .. n] do
+    out[i] := NumberBlist(x![i]) + (i - 1) * 2 ^ n;
+  od;
+  return out;
+end;
+
+SEMIGROUPS.BooleanMatSet := function(set)
+  local n, x, i;
+  n := Length(set);
+  x := EmptyPlist(n);
+  for i in [1 .. n] do
+    x[i] := BlistNumber(set[i] - (i - 1) * 2 ^ n, n);
+  od;
+  return MatrixNC(BooleanMatType, x);
+end;
+
+#############################################################################
+## Specializations of methods for MatrixOverSemiring
+#############################################################################
+
+InstallMethod(SEMIGROUPS_TypeViewStringOfMatrixOverSemiring,
+"for a boolean matrix",
+[IsBooleanMat], x -> "boolean");
+
+InstallMethod(SEMIGROUPS_FilterOfMatrixOverSemiring,
+"for a boolean matrix",
+[IsBooleanMat], x -> IsBooleanMat);
+
+InstallMethod(SEMIGROUPS_TypeOfMatrixOverSemiringCons,
+"for IsBooleanMat",
+[IsBooleanMat], x -> BooleanMatType);
+
+InstallGlobalFunction(BooleanMat,
+function(mat)
+  local n, x, blist, i, j, row;
+
+  if (not IsList(mat)) or IsEmpty(mat)
+      or not ForAll(mat, IsHomogeneousList) then
+    ErrorNoReturn("the argument is not a non-empty list ",
+                  "of homogeneous lists");
+  elif IsRectangularTable(mat) then  # 0s and 1s or blists
+    if ForAll(mat, row -> ForAll(row, x -> x = 0 or x = 1)) then
+      # 0s and 1s
+      n := Length(mat[1]);
+      x := EmptyPlist(n);
+      for i in [1 .. n] do
+        blist := BlistList([1 .. n], []);
+        for j in [1 .. n] do
+          if mat[i][j] = 1 then
+            blist[j] := true;
+          fi;
+        od;
+        Add(x, blist);
+      od;
+      return MatrixNC(BooleanMatType, x);
+    elif ForAll(mat, row -> ForAll(row, x -> x = true or x = false)) then
+      # blists
+      x := ShallowCopy(mat);
+      for row in x do
+        if not IsBlistRep(row) then
+          ConvertToBlistRep(row);
+        fi;
+      od;
+      return MatrixNC(BooleanMatType, x);
+    fi;
+  fi;
+  # successors
+  n := Length(mat);
+  x := EmptyPlist(n);
+  for i in [1 .. n] do
+    if not ForAll(mat[i], x -> IsPosInt(x) and x <= n) then
+      ErrorNoReturn("the entries of each list must not exceed ", n);
+    fi;
+    Add(x, BlistList([1 .. n], mat[i]));
+  od;
+  return MatrixNC(BooleanMatType, x);
+end);
+
+InstallMethod(\*, "for boolean matrices", [IsBooleanMat, IsBooleanMat],
+function(x, y)
+  local n, xy, i, j, k;
+
+  n := Minimum(Length(x![1]), Length(y![1]));
+  xy := List([1 .. n], x -> BlistList([1 .. n], []));
+
+  for i in [1 .. n] do
+    for j in [1 .. n] do
+      for k in [1 .. n] do
+        if x![i][k] and y![k][j] then
+          xy![i][j] := true;
+          break;
+        fi;
+      od;
+    od;
+  od;
+  return MatrixNC(x, xy);
+end);
+
+InstallMethod(\<, "for boolean matrices",
+[IsBooleanMat, IsBooleanMat],
+function(x, y)
+  local n, i;
+
+  n := Length(x![1]);
+  if n < Length(y![1]) then
+    return true;
+  elif n > Length(y![1]) then
+    return false;
+  fi;
+
+  i := 1;
+  while IsBound(x![i]) do
+    # this is the opposite way around than general matrices over semirings
+    # since for some reason true < false in GAP.
+    if x![i] > y![i] then
+      return true;
+    elif x![i] < y![i] then
+      return false;
+    fi;
+    i := i + 1;
+  od;
+  return false;
+end);
+
+InstallMethod(OneImmutable, "for a boolean mat",
+[IsBooleanMat],
+function(x)
+  local n, id, i;
+
+  n := DimensionOfMatrixOverSemiring(x);
+  id := List([1 .. n], x -> BlistList([1 .. n], []));
+  for i in [1 .. n] do
+    id[i][i] := true;
+  od;
+  return MatrixNC(x, id);
+end);
+
+InstallMethod(RandomMatrixCons, "for IsBooleanMat and a pos int",
+[IsBooleanMat, IsPosInt],
+function(_, n)
+  local x, i, j;
+
+  x := List([1 .. n], x -> BlistList([1 .. n], []));
+  for i in [1 .. n] do
+    for j in [1 .. n] do
+      x[i][j] := Random([true, false]);
+    od;
+  od;
+  Perform(x, ConvertToBlistRep);
+  return MatrixNC(BooleanMatType, x);
+end);
+
+#############################################################################
+## Special methods for Boolean matrices
+#############################################################################
+
+InstallMethod(\in, "for a boolean mat and boolean mat",
+[IsBooleanMat, IsBooleanMat],
+function(x, y)
+  local n, i, j;
+
+  n := Length(x![1]);
+
+  if n <> Length(y![1]) then
+    ErrorNoReturn("the arguments (boolean matrices) do not have ",
+                  "equal dimensions");
+  fi;
+
+  for i in [1 .. n] do
+    for j in [1 .. n] do
+      if x![i][j] and not y![i][j] then
+        return false;
+      fi;
+    od;
+  od;
+
+  return true;
+end);
+
+InstallGlobalFunction(OnBlist,
+function(blist1, x)
+  local n, blist2, i, j;
+
+  n := Length(blist1);
+  blist2 := BlistList([1 .. n], []);
+
+  for i in [1 .. n] do
+    for j in [1 .. n] do
+      blist2[i] := blist2[i] or (blist1[j] and x![j][i]);
+    od;
+  od;
+  return blist2;
+end);
+
+InstallMethod(Successors, "for a boolean matrix",
+[IsBooleanMat],
+function(x)
+  local n;
+  n := Length(x![1]);
+  return List([1 .. n], i -> ListBlist([1 .. n], x![i]));
+end);
+
+InstallMethod(IsRowTrimBooleanMat, "for a boolean matrix",
+[IsBooleanMat],
+function(x)
+  local n, i, j;
+
+  n := Length(x![1]);
+  for i in [1 .. n - 1] do
+    for j in [i + 1 .. n] do
+      if IsSubsetBlist(x![i], x![j]) or
+          IsSubsetBlist(x![j], x![i]) then
+        return false;
+      fi;
+    od;
+  od;
+  return true;
+end);
+
+InstallMethod(IsColTrimBooleanMat, "for a boolean matrix",
+[IsBooleanMat],
+function(x)
+  local n, contained, row, i, j, k;
+
+  n := Length(x![1]);
+  for i in [1 .. n] do
+    for j in [1 .. n] do
+      if i <> j then
+        contained := true;
+        for k in [1 .. n] do
+          row := x![k];
+          if (row[j] and not row[i]) then
+            contained := false;
+            break;
+          fi;
+        od;
+        if contained then
+          return false;
+        fi;
+      fi;
+    od;
+  od;
+  return true;
+end);
+
+InstallMethod(IsTrimBooleanMat, "for a boolean matrix",
+[IsBooleanMat], x -> IsRowTrimBooleanMat(x) and IsColTrimBooleanMat(x));
+
+InstallMethod(DisplayString, "for a boolean matrix",
+[IsBooleanMat],
+function(x)
+  local n, str, i, j;
+
+  n := DimensionOfMatrixOverSemiring(x);
+  str := "";
+  for i in [1 .. n] do
+    for j in [1 .. n] do
+      if x![i][j] then
+        Append(str, String(1));
+      else
+        Append(str, String(0));
+      fi;
+      Append(str, " ");
+    od;
+    Remove(str, Length(str));
+    Append(str, "\n");
+  od;
+  return str;
+end);
+
+InstallMethod(NumberBooleanMat, "for a boolean mat", [IsBooleanMat],
+function(x)
+  local n, nr, i, j;
+
+  n := DimensionOfMatrixOverSemiring(x);
+  nr := 0;
+  for i in [1 .. n] do
+    for j in [1 .. n] do
+      if x![i][j] then
+        nr := 2 * nr + 1;
+      else
+        nr := 2 * nr;
+      fi;
+    od;
+  od;
+  return nr + 1;   # to be in [1 .. 2 ^ (n ^ 2)]
+end);
+
+InstallMethod(BooleanMatNumber,
+"for a positive integer and positive integer",
+[IsPosInt, IsPosInt],
+function(nr, deg)
+  local x, q, i, j;
+
+  x := List([1 .. deg], x -> BlistList([1 .. deg], []));
+  nr := nr - 1;   # to be in [0 .. 2 ^ (deg ^ 2) - 1]
+  for i in [deg, deg - 1 .. 1] do
+    for j in [deg, deg - 1 .. 1] do
+      q := nr mod 2;
+      if q = 0 then
+        x[i][j] := false;
+      else
+        x[i][j] := true;
+      fi;
+      nr := (nr - q) / 2;
+    od;
+  od;
+  return MatrixNC(BooleanMatType, x);
+end);
+
+InstallGlobalFunction(NumberBlist,
+function(blist)
+  local n, nr, i;
+  n := Length(blist);
+  nr := 0;
+  for i in [1 .. n] do
+    if blist[i] then
+      nr := 2 * nr + 1;
+    else
+      nr := 2 * nr;
+    fi;
+  od;
+  return nr + 1;   # to be in [1 .. 2 ^ n]
+end);
+
+InstallGlobalFunction(BlistNumber,
+function(nr, n)
+  local x, q, i;
+
+  x := BlistList([1 .. n], []);
+  nr := nr - 1;   # to be in [0 .. 2 ^ n - 1]
+  for i in [n, n - 1 .. 1] do
+    q := nr mod 2;
+    if q = 0 then
+      x[i] := false;
+    else
+      x[i] := true;
+    fi;
+    nr := (nr - q) / 2;
+  od;
+  return x;
+end);
+
+InstallMethod(AsDigraph, "for a boolean matrix",
+[IsBooleanMat],
+{mat} -> DigraphByAdjacencyMatrix(AsList(mat)));
+
+InstallMethod(AsBooleanMat, "for a digraph",
+[IsDigraph],
+function(digraph)
+  local n, out, mat, X, i;
+
+  n   := DigraphNrVertices(digraph);
+  out := OutNeighbours(digraph);
+
+  mat := EmptyPlist(n);
+  X   := [1 .. DigraphNrVertices(digraph)];
+  for i in X do
+    mat[i] := BlistList(X, out[i]);
+  od;
+  return MatrixNC(BooleanMatType, mat);
+end);
+
+InstallMethod(AsBooleanMat, "for a partitioned binary relation",
+[IsPBR], x -> AsBooleanMat(x, 2 * DegreeOfPBR(x)));
+
+InstallMethod(AsBooleanMat, "for a partitioned binary relation and pos int",
+[IsPBR, IsPosInt],
+function(x, n)
+  local y, i;
+
+  y := EmptyPlist(n);
+  for i in [2 .. 2 * x![1] + 1] do
+    Add(y, BlistList([1 .. n], x![i]));
+  od;
+  for i in [2 * x![1] + 1 .. n] do
+    Add(y, BlistList([1 .. n], []));
+  od;
+
+  return BooleanMat(y);
+end);
+
+InstallMethod(AsBooleanMat, "for a bipartition",
+[IsBipartition], x -> AsBooleanMat(x, 2 * DegreeOfBipartition(x)));
+
+InstallMethod(AsBooleanMat, "for a bipartition and pos int",
+[IsBipartition, IsPosInt],
+function(x, n)
+  local deg, blocks, out, i, block;
+
+  deg := DegreeOfBipartition(x);
+  blocks := ShallowCopy(ExtRepOfObj(x));
+  out := EmptyPlist(n);
+
+  for block in blocks do
+    block := ShallowCopy(block);
+    for i in [1 .. Length(block)] do
+      if block[i] < 0 then
+        block[i] := -block[i] + deg;
+      fi;
+    od;
+    for i in block do
+      out[i] := BlistList([1 .. n], block);
+    od;
+  od;
+
+  for i in [Length(out) + 1 .. n] do
+    out[i] := BlistList([1 .. n], []);
+  od;
+
+  return BooleanMat(out);
+end);
+
+InstallMethod(AsBooleanMat, "for a transformation",
+[IsTransformation], x -> AsBooleanMat(x, DegreeOfTransformation(x)));
+
+InstallMethod(AsBooleanMat, "for a transformation and pos int",
+[IsTransformation, IsPosInt],
+function(x, n)
+  local out, i;
+  if ForAny([1 .. n], i -> i ^ x > n) then
+    ErrorNoReturn("the transformation in the 1st argument does not map ",
+                  "[1 .. ", String(n), "] to itself");
+  fi;
+
+  out := List([1 .. n], x -> BlistList([1 .. n], []));
+  for i in [1 .. n] do
+    out[i][i ^ x] := true;
+  od;
+  return MatrixNC(BooleanMatType, out);
+end);
+
+InstallMethod(AsBooleanMat, "for a perm",
+[IsPerm], x -> AsBooleanMat(AsTransformation(x)));
+
+InstallMethod(AsBooleanMat, "for a perm",
+[IsPerm, IsPosInt],
+{x, n} -> AsBooleanMat(AsTransformation(x), n));
+
+InstallMethod(AsBooleanMat, "for a partial perm",
+[IsPartialPerm],
+x -> AsBooleanMat(x, Maximum(DegreeOfPartialPerm(x),
+                             CodegreeOfPartialPerm(x))));
+
+InstallMethod(AsBooleanMat, "for a transformation and pos int",
+[IsPartialPerm, IsPosInt],
+function(x, n)
+  local out, j, i;
+
+  if ForAny([1 .. n], i -> i ^ x > n) then
+    ErrorNoReturn("the partial perm in the 1st argument does not map ",
+                  "[1 .. ", String(n), "] into itself");
+  fi;
+
+  out := List([1 .. n], x -> BlistList([1 .. n], []));
+  for i in [1 .. n] do
+    j := i ^ x;
+    if j <> 0 then
+      out[i][j] := true;
+    fi;
+  od;
+  Perform(out, ConvertToBlistRep);
+  return MatrixNC(BooleanMatType, out);
+end);
+
+InstallMethod(AsBooleanMat, "for a boolean mat and IsPosInt",
+[IsBooleanMat, IsPosInt],
+function(mat, m)
+  local n, out, i;
+
+  n := Length(mat![1]);
+  if m < n then
+    return MatrixNC(BooleanMatType,
+                    List([1 .. m], i -> mat![i]{[1 .. m]}));
+  fi;
+  out := AsMutableList(mat);
+  for i in [1 .. n] do
+    Append(out[i], BlistList([n + 1 .. m], []));
+  od;
+  for i in [n + 1 .. m] do
+    Add(out, BlistList([1 .. m], []));
+  od;
+  Perform(out, ConvertToBlistRep);
+  return MatrixNC(BooleanMatType, out);
+end);
+
+# TODO(later) AsBooleanMat for a BooleanMat
+
+InstallMethod(ChooseHashFunction, "for a boolean matrix",
+[IsBooleanMat, IsInt],
+{_, hashlen} -> rec(func := SEMIGROUPS.HashFunctionBooleanMat,
+                    data := hashlen));
+
+InstallMethod(CanonicalBooleanMat, "for boolean mat",
+[IsBooleanMat],
+function(mat)
+  local _AsDigraph, _AsBooleanMat, gr, colors, p;
+
+  # convert a boolean mat to a bipartite graph with all edges pointing in the
+  # same direction (so that we may act on the rows and columns independently).
+  _AsDigraph := function(mat)
+    local n, out, ver, row, i, j;
+
+    n := Length(mat![1]);
+    out := List([1 .. 2 * n], x -> []);
+    ver := [1 .. n];
+    for i in ver do
+      row := mat![i];
+      for j in ver do
+        if row[j] then
+          Add(out[i], j + n);
+        fi;
+      od;
+    od;
+    return DigraphNC(out);
+  end;
+
+  # convert a digraph (of the type created by _AsDigraph above) back into a
+  # boolean mat.
+  _AsBooleanMat := function(digraph)
+    local n, ver, out, mat, i;
+
+    n := DigraphNrVertices(digraph) / 2;
+    ver := [1 .. n];
+    out := OutNeighbours(digraph);
+    mat := EmptyPlist(n);
+
+    for i in ver do
+      mat[i] := BlistList(ver, out[i] - n);
+    od;
+
+    return MatrixNC(BooleanMatType, mat);
+  end;
+
+  # convert mat to a bipartite graph
+  gr := _AsDigraph(mat);
+
+  # calculate a canonical representative of the digraph, use colors to prevent
+  # the two sets of vertices in the bipartite graph from being swapped (which
+  # corresponds to swapping rows and columns of the Boolean matrix.
+  colors := Concatenation([1 .. Length(mat![1])] * 0 + 1,
+                          [1 .. Length(mat![1])] * 0 + 2);
+
+  p  := BlissCanonicalLabelling(gr, colors);
+  return _AsBooleanMat(OnDigraphs(gr, p));
+end);
+
+InstallMethod(CanonicalBooleanMat, "for perm group and boolean mat",
+[IsPermGroup, IsBooleanMat],
+function(G, x)
+  if IsNaturalSymmetricGroup(G) and MovedPoints(G) = [1 .. Length(x![1])] then
+    return CanonicalBooleanMat(x);
+  fi;
+  return CanonicalBooleanMat(G, G, x);
+end);
+
+InstallMethod(CanonicalBooleanMat, "for perm group and boolean mat",
+[IsPermGroup, IsPermGroup, IsBooleanMat],
+function(G, H, x)
+  local n;
+  n := Length(x![1]);
+  if LargestMovedPoint(G) > n or LargestMovedPoint(H) > n then
+    ErrorNoReturn("the largest moved point of the 1st argument ",
+                  "(a perm group) exceeds the dimension of the ",
+                  "3rd argument (a boolean matrix)");
+  elif G = H and IsNaturalSymmetricGroup(G)
+      and MovedPoints(G) = [1 .. n] then
+    return CanonicalBooleanMat(x);
+  fi;
+  return CanonicalBooleanMatNC(G, H, x);
+end);
+
+InstallMethod(CanonicalBooleanMatNC,
+"for perm group, perm group, and boolean mat",
+[IsPermGroup, IsPermGroup, IsBooleanMat],
+function(G, H, x)
+  local n, V, phi, act, map;
+  n := Length(x![1]);
+  V := DirectProduct(G, H);
+  phi := Projection(V, 2);
+
+  act := function(pt, p)
+    local q, r, nr;
+    pt := pt - 1;
+    q := QuoInt(pt, 2 ^ n);  # row
+    r := pt - q * 2 ^ n;     # number blist of the row
+                             # permute columns
+    nr := NumberBlist(Permuted(BlistNumber(r + 1, n), p));
+    # and then the row
+    return nr + ((q + 1) ^ (p ^ phi) - 1) * 2 ^ n;
+  end;
+
+   map := ActionHomomorphism(V, [1 .. n * 2 ^ n], act);
+   return SEMIGROUPS.BooleanMatSet(CanonicalImage(Image(map),
+                                                  SEMIGROUPS.SetBooleanMat(x),
+                                                  OnSets));
+end);
+
+InstallMethod(IsSymmetricBooleanMat, "for a boolean matrix",
+[IsBooleanMat],
+function(x)
+  local n, i, j;
+  n := Length(x![1]);
+  for i in [1 .. n - 1] do
+    for j in [i + 1 .. n] do
+      if x![i][j] <> x![j][i] then
+        return false;
+      fi;
+    od;
+  od;
+  return true;
+end);
+
+InstallMethod(IsReflexiveBooleanMat, "for a boolean matrix",
+[IsBooleanMat],
+function(x)
+  local n, i;
+  n := Length(x![1]);
+  for i in [1 .. n] do
+    if not x![i][i] then
+      return false;
+    fi;
+  od;
+  return true;
+end);
+
+InstallMethod(IsTransitiveBooleanMat, "for a boolean matrix",
+[IsBooleanMat],
+function(x)
+  local n, i, j, k;
+  n := [1 .. Length(x![1])];
+  for i in n do
+    for j in n do
+      for k in n do
+        if x![i][k] and x![k][j] and not x![i][j] then
+          return false;
+        fi;
+      od;
+    od;
+  od;
+  return true;
+end);
+
+InstallMethod(IsAntiSymmetricBooleanMat, "for a boolean matrix",
+[IsBooleanMat],
+function(x)
+  local n, i, j;
+  n := Length(x![1]);
+  for i in [1 .. n - 1] do
+    for j in [i + 1 .. n] do
+      if x![i][j] and x![j][i] then
+        return false;
+      fi;
+    od;
+  od;
+  return true;
+end);
+
+InstallMethod(IsTotalBooleanMat, "for a boolean matrix",
+[IsBooleanMat],
+function(x)
+  local n, i;
+  n := Length(x![1]);
+  for i in [1 .. n] do
+    if SizeBlist(x![i]) = 0 then
+      return false;
+    fi;
+  od;
+  return true;
+end);
+
+InstallMethod(IsOntoBooleanMat, "for a boolean matrix",
+[IsBooleanMat], x -> IsTotalBooleanMat(TransposedMat(x)));
+
+InstallMethod(IsTransformationBooleanMat, "for a boolean matrix",
+[IsBooleanMat],
+function(x)
+  local n, i;
+  n := Length(x[1]);
+  for i in [1 .. n] do
+    if SizeBlist(x[i]) <> 1 then
+      return false;
+    fi;
+  od;
+  return true;
+end);