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

gap/pkg/semigroups/tst/standard/semigroups/semimaxplus.tst

@@ -0,0 +1,654 @@
+#############################################################################
+##
+#W  standard/semigroups/semimaxplus.tst
+#Y  Copyright (C) 2015-2022                              James D. Mitchell
+##
+##  Licensing information can be found in the README file of this package.
+##
+#############################################################################
+##
+
+#@local BruteForceInverseCheck, BruteForceIsoCheck, F, S, T, i, inv, map, mat
+#@local rels, x, y
+gap> START_TEST("Semigroups package: standard/semigroups/semimaxplus.tst");
+gap> LoadPackage("semigroups", false);;
+
+#
+gap> SEMIGROUPS.StartTest();
+
+# semimaxplus: C++ code working, for max-plus matrix semigroup
+gap> S := Semigroup(Matrix(IsMaxPlusMatrix, [[0, -4], [-4, -1]]),
+>                   Matrix(IsMaxPlusMatrix, [[0, -3], [-3, -1]]));
+<semigroup of 2x2 max-plus matrices with 2 generators>
+gap> Size(S);
+26
+gap> NrDClasses(S);
+23
+gap> NrRClasses(S);
+24
+gap> NrLClasses(S);
+24
+gap> NrHClasses(S);
+26
+gap> NrIdempotents(S);
+4
+gap> MultiplicativeZero(S);
+fail
+gap> AsSemigroup(IsMaxPlusMatrixSemigroup, S) = S;
+true
+
+# semimaxplus: C++ code working, for natural matrix semigroup
+gap> S := Monoid(Matrix(IsNTPMatrix, [[0, 1, 0], [1, 1, 0], [0, 1, 0]], 1, 2),
+>                Matrix(IsNTPMatrix, [[1, 0, 0], [1, 0, 1], [1, 0, 0]], 1, 2));
+<monoid of 3x3 ntp matrices with 2 generators>
+gap> Size(S);
+37
+gap> Length(RelationsOfFpMonoid(Range(IsomorphismFpMonoid(S))));
+12
+gap> NrDClasses(S);
+8
+gap> NrRClasses(S);
+14
+gap> NrLClasses(S);
+17
+gap> NrHClasses(S);
+35
+gap> NrIdempotents(S);
+20
+gap> MultiplicativeZero(S);
+fail
+
+# helper functions
+gap> BruteForceIsoCheck := function(iso)
+>   local x, y;
+>   if not IsInjective(iso) or not IsSurjective(iso) then
+>     return false;
+>   fi;
+>   for x in Generators(Source(iso)) do
+>     for y in Generators(Source(iso)) do
+>       if x ^ iso * y ^ iso <> (x * y) ^ iso then
+>         return false;
+>       fi;
+>     od;
+>   od;
+>   return true;
+> end;;
+gap> BruteForceInverseCheck := function(map)
+> local inv;
+>   inv := InverseGeneralMapping(map);
+>   return ForAll(Source(map), x -> x = (x ^ map) ^ inv)
+>     and ForAll(Range(map), x -> x = (x ^ inv) ^ map);
+> end;;
+
+# IsomorphismSemigroup: for semigroup of same type
+gap> S := Semigroup(Matrix(IsTropicalMaxPlusMatrix, [[0, 4], [4, 1]], 10));
+<commutative semigroup of 2x2 tropical max-plus matrices with 1 generator>
+gap> AsSemigroup(IsTropicalMaxPlusMatrixSemigroup, 10, S) = S;
+true
+gap> map := IsomorphismSemigroup(IsTropicalMaxPlusMatrixSemigroup, 11, S);;
+gap> T := Range(map);;
+gap> T = S;
+false
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+gap> S := Semigroup(Matrix(IsNTPMatrix, [[0, 0], [1, 3]], 2, 2));
+<commutative semigroup of 2x2 ntp matrices with 1 generator>
+gap> AsSemigroup(IsNTPMatrixSemigroup, 2, 2, S) = S;
+true
+gap> map := IsomorphismSemigroup(IsNTPMatrixSemigroup, 3, 3, S);;
+gap> T := Range(map);;
+gap> T = S;
+false
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+gap> S := FreeBand(2);
+<free band on the generators [ x1, x2 ]>
+gap> IsomorphismSemigroup(IsTropicalMaxPlusMatrixSemigroup, S);
+<free band on the generators [ x1, x2 ]> -> 
+<semigroup of size 6, 7x7 tropical max-plus matrices with 2 generators>
+gap> IsomorphismSemigroup(IsNTPMatrixSemigroup, S);
+<free band on the generators [ x1, x2 ]> -> 
+<semigroup of size 6, 7x7 ntp matrices with 2 generators>
+
+# AsSemigroup:
+#   convert from IsPBRSemigroup to IsMaxPlusMatrixSemigroup
+gap> S := Semigroup([
+> PBR([[-2], [-3], [-4], [-5], [-6], [-7], [-8], [-8], [-1]],
+>      [[9], [1], [2], [3], [4], [5], [6], [7, 8], []])]);
+<commutative pbr semigroup of degree 9 with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of size 8, 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsFpSemigroup to IsMaxPlusMatrixSemigroup
+gap> F := FreeSemigroup(1);; AssignGeneratorVariables(F);;
+gap> rels := [[s1 ^ 9, s1 ^ 8]];;
+gap> S := F / rels;
+<fp semigroup with 1 generator and 1 relation of length 18>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of size 8, 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsBipartitionSemigroup to IsMaxPlusMatrixSemigroup
+gap> S := Semigroup([
+>  Bipartition([[1, -2], [2, -3], [3, -4], [4, -5], [5, -6], [6, -7],
+>               [7, 8, -8], [9, -1], [-9]])]);
+<commutative bipartition semigroup of degree 9 with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsTransformationSemigroup to IsMaxPlusMatrixSemigroup
+gap> S := Semigroup([Transformation([2, 3, 4, 5, 6, 7, 8, 8, 1])]);
+<commutative transformation semigroup of degree 9 with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsBooleanMatSemigroup to IsMaxPlusMatrixSemigroup
+gap> S := Semigroup([
+> Matrix(IsBooleanMat,
+>  [[false, true, false, false, false, false, false, false, false],
+>   [false, false, true, false, false, false, false, false, false],
+>   [false, false, false, true, false, false, false, false, false],
+>   [false, false, false, false, true, false, false, false, false],
+>   [false, false, false, false, false, true, false, false, false],
+>   [false, false, false, false, false, false, true, false, false],
+>   [false, false, false, false, false, false, false, true, false],
+>   [false, false, false, false, false, false, false, true, false],
+>   [true, false, false, false, false, false, false, false, false]])]);
+<commutative semigroup of 9x9 boolean matrices with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsMaxPlusMatrixSemigroup to IsMaxPlusMatrixSemigroup
+gap> mat := ListWithIdenticalEntries(9, -infinity);;
+gap> mat := List([1 .. 9], x -> ShallowCopy(mat));;
+gap> for i in [1 .. 7] do mat[i][i + 1] := 0; od;
+gap> mat[8][8] := 0;;
+gap> mat[9][1] := 0;;
+gap> S := Semigroup(Matrix(IsMaxPlusMatrix, mat));
+<commutative semigroup of 9x9 max-plus matrices with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsMinPlusMatrixSemigroup to IsMaxPlusMatrixSemigroup
+gap> mat := ListWithIdenticalEntries(9, infinity);;
+gap> mat := List([1 .. 9], x -> ShallowCopy(mat));;
+gap> for i in [1 .. 7] do mat[i][i + 1] := 0; od;
+gap> mat[8][8] := 0;;
+gap> mat[9][1] := 0;;
+gap> S := Semigroup(Matrix(IsMinPlusMatrix, mat));
+<commutative semigroup of 9x9 min-plus matrices with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of size 8, 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsProjectiveMaxPlusMatrixSemigroup to IsMaxPlusMatrixSemigroup
+gap> mat := ListWithIdenticalEntries(9, -infinity);;
+gap> mat := List([1 .. 9], x -> ShallowCopy(mat));;
+gap> for i in [1 .. 7] do mat[i][i + 1] := 0; od;
+gap> mat[8][8] := 0;;
+gap> mat[9][1] := 0;;
+gap> S := Semigroup(Matrix(IsProjectiveMaxPlusMatrix, mat));
+<commutative semigroup of 9x9 projective max-plus matrices with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of size 8, 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsIntegerMatrixSemigroup to IsMaxPlusMatrixSemigroup
+gap> S := Semigroup([
+> Matrix(Integers,
+>        [[0, 1, 0, 0, 0, 0, 0, 0, 0],
+>         [0, 0, 1, 0, 0, 0, 0, 0, 0],
+>         [0, 0, 0, 1, 0, 0, 0, 0, 0],
+>         [0, 0, 0, 0, 1, 0, 0, 0, 0],
+>         [0, 0, 0, 0, 0, 1, 0, 0, 0],
+>         [0, 0, 0, 0, 0, 0, 1, 0, 0],
+>         [0, 0, 0, 0, 0, 0, 0, 1, 0],
+>         [0, 0, 0, 0, 0, 0, 0, 1, 0],
+>         [1, 0, 0, 0, 0, 0, 0, 0, 0]])]);
+<commutative semigroup of 9x9 integer matrices with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of size 8, 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsTropicalMaxPlusMatrixSemigroup to IsMaxPlusMatrixSemigroup
+gap> mat := ListWithIdenticalEntries(9, -infinity);;
+gap> mat := List([1 .. 9], x -> ShallowCopy(mat));;
+gap> for i in [1 .. 7] do mat[i][i + 1] := 0; od;
+gap> mat[8][8] := 0;;
+gap> mat[9][1] := 0;;
+gap> S := Semigroup(Matrix(IsTropicalMaxPlusMatrix, mat, 2));
+<commutative semigroup of 9x9 tropical max-plus matrices with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of size 8, 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsTropicalMinPlusMatrixSemigroup to IsMaxPlusMatrixSemigroup
+gap> mat := ListWithIdenticalEntries(9, infinity);;
+gap> mat := List([1 .. 9], x -> ShallowCopy(mat));;
+gap> for i in [1 .. 7] do mat[i][i + 1] := 0; od;
+gap> mat[8][8] := 0;;
+gap> mat[9][1] := 0;;
+gap> S := Semigroup(Matrix(IsTropicalMinPlusMatrix, mat, 4));
+<commutative semigroup of 9x9 tropical min-plus matrices with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of size 8, 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# AsSemigroup:
+#   convert from IsNTPMatrixSemigroup to IsMaxPlusMatrixSemigroup
+gap> S := Semigroup([
+> Matrix(IsNTPMatrix,
+>   [[0, 1, 0, 0, 0, 0, 0, 0, 0],
+>    [0, 0, 1, 0, 0, 0, 0, 0, 0],
+>    [0, 0, 0, 1, 0, 0, 0, 0, 0],
+>    [0, 0, 0, 0, 1, 0, 0, 0, 0],
+>    [0, 0, 0, 0, 0, 1, 0, 0, 0],
+>    [0, 0, 0, 0, 0, 0, 1, 0, 0],
+>    [0, 0, 0, 0, 0, 0, 0, 1, 0],
+>    [0, 0, 0, 0, 0, 0, 0, 1, 0],
+>    [1, 0, 0, 0, 0, 0, 0, 0, 0]], 3, 4)]);
+<commutative semigroup of 9x9 ntp matrices with 1 generator>
+gap> T := AsSemigroup(IsMaxPlusMatrixSemigroup, S);
+<commutative semigroup of size 8, 9x9 max-plus matrices with 1 generator>
+gap> Size(S) = Size(T);
+true
+gap> NrDClasses(S) = NrDClasses(T);
+true
+gap> NrRClasses(S) = NrRClasses(T);
+true
+gap> NrLClasses(S) = NrLClasses(T);
+true
+gap> NrIdempotents(S) = NrIdempotents(T);
+true
+gap> map := IsomorphismSemigroup(IsMaxPlusMatrixSemigroup, S);;
+gap> BruteForceIsoCheck(map);
+true
+gap> BruteForceInverseCheck(map);
+true
+
+# Test RandomSemigroup
+gap> RandomSemigroup(IsMaxPlusMatrixSemigroup);;
+gap> RandomSemigroup(IsMaxPlusMatrixSemigroup, 2);;
+gap> RandomSemigroup(IsMaxPlusMatrixSemigroup, 2, 5);;
+gap> RandomSemigroup(IsTropicalMaxPlusMatrixSemigroup);;
+gap> RandomSemigroup(IsTropicalMaxPlusMatrixSemigroup, 2);;
+gap> RandomSemigroup(IsTropicalMaxPlusMatrixSemigroup, 2, 5);;
+gap> RandomSemigroup(IsTropicalMaxPlusMatrixSemigroup, 2, 2, 2);;
+gap> RandomSemigroup(IsTropicalMaxPlusMatrixSemigroup, "a");
+Error, the 2nd argument (number of generators) must be a pos int
+gap> RandomSemigroup(IsTropicalMaxPlusMatrixSemigroup, 2, "a");;
+Error, the 3rd argument (matrix dimension) must be a pos int
+gap> RandomSemigroup(IsTropicalMaxPlusMatrixSemigroup, 2, 2, "a");;
+Error, the 4th argument (semiring threshold) must be a pos int
+gap> RandomSemigroup(IsTropicalMaxPlusMatrixSemigroup, 2, 2, 2, 2);;
+Error, there must be at most four arguments
+gap> RandomMonoid(IsMaxPlusMatrixMonoid);;
+gap> RandomMonoid(IsMaxPlusMatrixMonoid, 2);;
+gap> RandomMonoid(IsMaxPlusMatrixMonoid, 2, 5);;
+gap> RandomMonoid(IsTropicalMaxPlusMatrixMonoid);;
+gap> RandomMonoid(IsTropicalMaxPlusMatrixMonoid, 2);;
+gap> RandomMonoid(IsTropicalMaxPlusMatrixMonoid, 2, 5);;
+gap> RandomMonoid(IsTropicalMaxPlusMatrixMonoid, 2, 2, 2);;
+gap> RandomMonoid(IsTropicalMaxPlusMatrixMonoid, "a");
+Error, the 2nd argument (number of generators) must be a pos int
+gap> RandomMonoid(IsTropicalMaxPlusMatrixMonoid, 2, "a");;
+Error, the 3rd argument (matrix dimension) must be a pos int
+gap> RandomMonoid(IsTropicalMaxPlusMatrixMonoid, 2, 2, "a");;
+Error, the 4th argument (semiring threshold) must be a pos int
+gap> RandomMonoid(IsTropicalMaxPlusMatrixMonoid, 2, 2, 2, 2);;
+Error, there must be at most four arguments
+gap> RandomSemigroup(IsNTPMatrixSemigroup);;
+gap> RandomSemigroup(IsNTPMatrixSemigroup, 2);;
+gap> RandomSemigroup(IsNTPMatrixSemigroup, 2, 5);;
+gap> RandomSemigroup(IsNTPMatrixSemigroup, 2, 2, 2);;
+gap> RandomSemigroup(IsNTPMatrixSemigroup, 2, 2, 2, 2);;
+gap> RandomSemigroup(IsNTPMatrixSemigroup, "a");
+Error, the 2nd argument (number of generators) must be a pos int
+gap> RandomSemigroup(IsNTPMatrixSemigroup, 2, "a");;
+Error, the 3rd argument (matrix dimension) must be a pos int
+gap> RandomSemigroup(IsNTPMatrixSemigroup, 2, 2, "a");;
+Error, the 4th argument (semiring threshold) must be a pos int
+gap> RandomSemigroup(IsNTPMatrixSemigroup, 2, 2, 2, "a");;
+Error, the 5th argument (semiring period) must be a pos int
+gap> RandomSemigroup(IsNTPMatrixSemigroup, 2, 2, 2, 2, 2);;
+Error, there must be at most 5 arguments
+gap> RandomMonoid(IsNTPMatrixMonoid);;
+gap> RandomMonoid(IsNTPMatrixMonoid, 2);;
+gap> RandomMonoid(IsNTPMatrixMonoid, 2, 5);;
+gap> RandomMonoid(IsNTPMatrixMonoid, 2, 2, 2);;
+gap> RandomMonoid(IsNTPMatrixMonoid, 2, 2, 2, 2);;
+gap> RandomMonoid(IsNTPMatrixMonoid, "a");
+Error, the 2nd argument (number of generators) must be a pos int
+gap> RandomMonoid(IsNTPMatrixMonoid, 2, "a");;
+Error, the 3rd argument (matrix dimension) must be a pos int
+gap> RandomMonoid(IsNTPMatrixMonoid, 2, 2, "a");;
+Error, the 4th argument (semiring threshold) must be a pos int
+gap> RandomMonoid(IsNTPMatrixMonoid, 2, 2, 2, "a");;
+Error, the 5th argument (semiring period) must be a pos int
+gap> RandomMonoid(IsNTPMatrixMonoid, 2, 2, 2, 2, 2);;
+Error, there must be at most 5 arguments
+
+# IsFinite, IsTorsion, NormalizeSemigroup
+gap> IsFinite(Semigroup(Matrix(IsMaxPlusMatrix, [[0, -3], [-2, -10]])));
+true
+gap> IsFinite(Semigroup(Matrix(IsMaxPlusMatrix, [[-infinity, 1, -infinity],
+> [-infinity, -infinity, -infinity], [-infinity, 1, -infinity]])));
+true
+gap> IsFinite(Semigroup(Matrix(IsMaxPlusMatrix,
+> [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]])));
+false
+gap> IsFinite(Semigroup([
+> Matrix(IsMaxPlusMatrix,
+>        [[0, -infinity, -1], [0, -infinity, -4], [-infinity, 0, -infinity]]),
+> Matrix(IsMaxPlusMatrix,
+>        [[-2, -2, 0], [0, -infinity, -3], [-5, 0, -infinity]]),
+> Matrix(IsMaxPlusMatrix,
+>        [[-infinity, -infinity, -infinity],
+>         [0, 0, -infinity],
+>         [-5, 0, -infinity]])]));
+false
+gap> IsFinite(Semigroup(Matrix(IsMinPlusMatrix, [[infinity, 0], [5, 4]])));
+false
+gap> IsFinite(Semigroup(Matrix(IsMinPlusMatrix, [[1, 0], [0, infinity]])));
+true
+gap> IsFinite(Semigroup(Matrix(IsMinPlusMatrix, [[infinity, -2], [2, 1]])));
+true
+gap> NormalizeSemigroup(Semigroup([
+> Matrix(IsMaxPlusMatrix, [[0, -3], [-2, -10]])]));
+<commutative semigroup of 2x2 max-plus matrices with 1 generator>
+gap> IsTorsion(Semigroup(Matrix(IsMaxPlusMatrix, [[0, -3], [-2, -10]])));
+true
+gap> IsTorsion(Semigroup(Matrix(IsMaxPlusMatrix,
+> [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]])));
+false
+
+# AsMonoid
+gap> S := AsSemigroup(IsMaxPlusMatrixSemigroup,
+> Semigroup(Transformation([1, 2, 3, 3, 3])));
+<commutative semigroup of 5x5 max-plus matrices with 1 generator>
+gap> AsMonoid(S);
+<trivial group of 1x1 max-plus matrices with 1 generator>
+gap> S := AsSemigroup(IsMaxPlusMatrixSemigroup,
+> Semigroup(Transformation([1, 1]), Transformation([2, 2])));
+<semigroup of 2x2 max-plus matrices with 2 generators>
+gap> AsMonoid(S);
+fail
+gap> S := AsSemigroup(IsTropicalMaxPlusMatrixSemigroup, 3,
+> Semigroup(Transformation([1, 2, 3, 3, 3])));
+<commutative semigroup of 5x5 tropical max-plus matrices with 1 generator>
+gap> AsMonoid(S);
+<trivial group of 1x1 tropical max-plus matrices with 1 generator>
+gap> S := AsSemigroup(IsTropicalMaxPlusMatrixSemigroup, 3,
+> Semigroup(Transformation([1, 1]), Transformation([2, 2])));
+<semigroup of 2x2 tropical max-plus matrices with 2 generators>
+gap> AsMonoid(S);
+fail
+gap> S := AsSemigroup(IsNTPMatrixSemigroup, 3, 4,
+> Semigroup(Transformation([1, 2, 3, 3, 3])));
+<commutative semigroup of 5x5 ntp matrices with 1 generator>
+gap> AsMonoid(S);
+<trivial group of 1x1 ntp matrices with 1 generator>
+gap> S := AsSemigroup(IsNTPMatrixSemigroup, 3, 4,
+> Semigroup(Transformation([1, 1]), Transformation([2, 2])));
+<semigroup of 2x2 ntp matrices with 2 generators>
+gap> AsMonoid(S);
+fail
+
+# IsomorphismMonoid
+gap> map := IsomorphismMonoid(IsMaxPlusMatrixMonoid,
+> Semigroup(Transformation([1, 2, 3, 3, 3])));;
+gap> Range(map);
+<trivial group of 1x1 max-plus matrices with 1 generator>
+gap> map := IsomorphismMonoid(IsTropicalMaxPlusMatrixMonoid, 3,
+> Semigroup(Transformation([1, 2, 3, 3, 3])));;
+gap> Range(map);
+<trivial group of 1x1 tropical max-plus matrices with 1 generator>
+gap> map := IsomorphismMonoid(IsNTPMatrixMonoid, 3, 4,
+> Semigroup(Transformation([1, 2, 3, 3, 3])));;
+gap> Range(map);
+<trivial group of 1x1 ntp matrices with 1 generator>
+gap> S := Semigroup(Transformation([1, 2, 2, 2]));
+<commutative transformation semigroup of degree 4 with 1 generator>
+gap> S := AsSemigroup(IsTropicalMaxPlusMatrixSemigroup, S);
+<commutative semigroup of 4x4 tropical max-plus matrices with 1 generator>
+gap> map := IsomorphismMonoid(IsTropicalMaxPlusMatrixMonoid, S);
+<trivial group of 4x4 tropical max-plus matrices with 1 generator> -> 
+<trivial group of 1x1 tropical max-plus matrices with 1 generator>
+gap> map := IsomorphismMonoid(IsTropicalMaxPlusMatrixMonoid,
+> Semigroup(Transformation([1, 2, 2, 2])));;
+gap> map := IsomorphismMonoid(IsNTPMatrixMonoid, FreeBand(1));
+<free band on the generators [ x1 ]> -> 
+<trivial group of 1x1 ntp matrices with 1 generator>
+
+# FullTropicalMaxPlusMonoid
+gap> FullTropicalMaxPlusMonoid(3, 1);
+Error, the 1st argument (dimension) must be 2
+gap> S := FullTropicalMaxPlusMonoid(2, 1);
+<monoid of 2x2 tropical max-plus matrices with 6 generators>
+gap> Size(S);
+81
+gap> S := FullTropicalMaxPlusMonoid(2, 2);
+<monoid of 2x2 tropical max-plus matrices with 9 generators>
+gap> Size(S);
+256
+gap> S := FullTropicalMaxPlusMonoid(2, 3);
+<monoid of 2x2 tropical max-plus matrices with 13 generators>
+gap> Size(S);
+625
+
+# FullTropicalMinPlusMonoid
+gap> S := FullTropicalMinPlusMonoid(2, 1);
+<monoid of 2x2 tropical min-plus matrices with 5 generators>
+gap> Size(S);
+81
+gap> S := FullTropicalMinPlusMonoid(2, 2);
+<monoid of 2x2 tropical min-plus matrices with 6 generators>
+gap> Size(S);
+256
+gap> S := FullTropicalMinPlusMonoid(2, 3);
+<monoid of 2x2 tropical min-plus matrices with 7 generators>
+gap> Size(S);
+625
+gap> S := FullTropicalMinPlusMonoid(3, 1);
+<monoid of 3x3 tropical min-plus matrices with 11 generators>
+gap> Size(S);
+19683
+gap> S := FullTropicalMinPlusMonoid(4, 3);
+Error, the 1st argument (dimension) must be 2 or 3
+
+#
+gap> SEMIGROUPS.StopTest();
+gap> STOP_TEST("Semigroups package: standard/semigroups/semimaxplus.tst");