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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Potentially problematic release.

This version of passagemath-gap-pkg-semigroups might be problematic. Click here for more details.

Files changed (354) hide show
  1. gap/pkg/semigroups/CHANGELOG.md +1699 -0
  2. gap/pkg/semigroups/CONTRIBUTING.md +91 -0
  3. gap/pkg/semigroups/GNUmakefile +110 -0
  4. gap/pkg/semigroups/GNUmakefile.in +110 -0
  5. gap/pkg/semigroups/GPL +674 -0
  6. gap/pkg/semigroups/LICENSE +16 -0
  7. gap/pkg/semigroups/Makefile +26 -0
  8. gap/pkg/semigroups/Makefile.gappkg +225 -0
  9. gap/pkg/semigroups/PackageInfo.g +529 -0
  10. gap/pkg/semigroups/README.md +102 -0
  11. gap/pkg/semigroups/VERSIONS +112 -0
  12. gap/pkg/semigroups/aclocal.m4 +375 -0
  13. gap/pkg/semigroups/autogen.sh +25 -0
  14. gap/pkg/semigroups/bin/x86_64-apple-darwin22-default64-kv10/semigroups.so +0 -0
  15. gap/pkg/semigroups/config.guess +1807 -0
  16. gap/pkg/semigroups/config.log +1082 -0
  17. gap/pkg/semigroups/config.status +1134 -0
  18. gap/pkg/semigroups/config.sub +1960 -0
  19. gap/pkg/semigroups/configure +9742 -0
  20. gap/pkg/semigroups/configure.ac +71 -0
  21. gap/pkg/semigroups/data/doc/greens.pickle +1 -0
  22. gap/pkg/semigroups/data/gens/fullbool-8.pickle.gz +0 -0
  23. gap/pkg/semigroups/data/gens/fullbool.pickle.gz +0 -0
  24. gap/pkg/semigroups/data/gens/hall.pickle.gz +0 -0
  25. gap/pkg/semigroups/data/gens/reflex-6.pickle.gz +0 -0
  26. gap/pkg/semigroups/data/gens/reflex.pickle.gz +0 -0
  27. gap/pkg/semigroups/data/tst/bipart4 +10 -0
  28. gap/pkg/semigroups/data/tst/pperm10 +1 -0
  29. gap/pkg/semigroups/data/tst/tables.gz +0 -0
  30. gap/pkg/semigroups/data/tst/testdata +1 -0
  31. gap/pkg/semigroups/data/tst/testinstall.pickle +1 -0
  32. gap/pkg/semigroups/data/tst/trans3 +7 -0
  33. gap/pkg/semigroups/data/tst/trans3-old +7 -0
  34. gap/pkg/semigroups/environment.yml +7 -0
  35. gap/pkg/semigroups/gap/attributes/acting.gd +15 -0
  36. gap/pkg/semigroups/gap/attributes/acting.gi +297 -0
  37. gap/pkg/semigroups/gap/attributes/attr.gd +91 -0
  38. gap/pkg/semigroups/gap/attributes/attr.gi +1214 -0
  39. gap/pkg/semigroups/gap/attributes/dual.gd +25 -0
  40. gap/pkg/semigroups/gap/attributes/dual.gi +209 -0
  41. gap/pkg/semigroups/gap/attributes/factor.gd +17 -0
  42. gap/pkg/semigroups/gap/attributes/factor.gi +453 -0
  43. gap/pkg/semigroups/gap/attributes/homomorph.gd +84 -0
  44. gap/pkg/semigroups/gap/attributes/homomorph.gi +591 -0
  45. gap/pkg/semigroups/gap/attributes/inverse.gd +38 -0
  46. gap/pkg/semigroups/gap/attributes/inverse.gi +708 -0
  47. gap/pkg/semigroups/gap/attributes/isomorph.gd +16 -0
  48. gap/pkg/semigroups/gap/attributes/isomorph.gi +377 -0
  49. gap/pkg/semigroups/gap/attributes/isorms.gd +49 -0
  50. gap/pkg/semigroups/gap/attributes/isorms.gi +1383 -0
  51. gap/pkg/semigroups/gap/attributes/maximal.gd +16 -0
  52. gap/pkg/semigroups/gap/attributes/maximal.gi +1876 -0
  53. gap/pkg/semigroups/gap/attributes/properties.gd +109 -0
  54. gap/pkg/semigroups/gap/attributes/properties.gi +1658 -0
  55. gap/pkg/semigroups/gap/attributes/rms-translat.gd +39 -0
  56. gap/pkg/semigroups/gap/attributes/rms-translat.gi +1078 -0
  57. gap/pkg/semigroups/gap/attributes/semifp.gd +12 -0
  58. gap/pkg/semigroups/gap/attributes/semifp.gi +84 -0
  59. gap/pkg/semigroups/gap/attributes/translat.gd +474 -0
  60. gap/pkg/semigroups/gap/attributes/translat.gi +1779 -0
  61. gap/pkg/semigroups/gap/congruences/cong.gd +154 -0
  62. gap/pkg/semigroups/gap/congruences/cong.gi +351 -0
  63. gap/pkg/semigroups/gap/congruences/conginv.gd +38 -0
  64. gap/pkg/semigroups/gap/congruences/conginv.gi +589 -0
  65. gap/pkg/semigroups/gap/congruences/conglatt.gd +101 -0
  66. gap/pkg/semigroups/gap/congruences/conglatt.gi +886 -0
  67. gap/pkg/semigroups/gap/congruences/congpairs.gd +21 -0
  68. gap/pkg/semigroups/gap/congruences/congpairs.gi +272 -0
  69. gap/pkg/semigroups/gap/congruences/congpart.gd +90 -0
  70. gap/pkg/semigroups/gap/congruences/congpart.gi +449 -0
  71. gap/pkg/semigroups/gap/congruences/congrees.gd +20 -0
  72. gap/pkg/semigroups/gap/congruences/congrees.gi +313 -0
  73. gap/pkg/semigroups/gap/congruences/congrms.gd +54 -0
  74. gap/pkg/semigroups/gap/congruences/congrms.gi +1467 -0
  75. gap/pkg/semigroups/gap/congruences/congsemigraph.gd +28 -0
  76. gap/pkg/semigroups/gap/congruences/congsemigraph.gi +289 -0
  77. gap/pkg/semigroups/gap/congruences/congsimple.gd +27 -0
  78. gap/pkg/semigroups/gap/congruences/congsimple.gi +236 -0
  79. gap/pkg/semigroups/gap/congruences/conguniv.gd +20 -0
  80. gap/pkg/semigroups/gap/congruences/conguniv.gi +271 -0
  81. gap/pkg/semigroups/gap/congruences/congwordgraph.gd +21 -0
  82. gap/pkg/semigroups/gap/congruences/congwordgraph.gi +250 -0
  83. gap/pkg/semigroups/gap/elements/bipart.gd +71 -0
  84. gap/pkg/semigroups/gap/elements/bipart.gi +995 -0
  85. gap/pkg/semigroups/gap/elements/blocks.gd +31 -0
  86. gap/pkg/semigroups/gap/elements/blocks.gi +134 -0
  87. gap/pkg/semigroups/gap/elements/boolmat.gd +74 -0
  88. gap/pkg/semigroups/gap/elements/boolmat.gi +726 -0
  89. gap/pkg/semigroups/gap/elements/elements.gd +11 -0
  90. gap/pkg/semigroups/gap/elements/elements.gi +121 -0
  91. gap/pkg/semigroups/gap/elements/ffmat.gd +71 -0
  92. gap/pkg/semigroups/gap/elements/ffmat.gi +311 -0
  93. gap/pkg/semigroups/gap/elements/maxplusmat.gd +131 -0
  94. gap/pkg/semigroups/gap/elements/maxplusmat.gi +782 -0
  95. gap/pkg/semigroups/gap/elements/pbr.gd +51 -0
  96. gap/pkg/semigroups/gap/elements/pbr.gi +740 -0
  97. gap/pkg/semigroups/gap/elements/pperm.gd +11 -0
  98. gap/pkg/semigroups/gap/elements/pperm.gi +14 -0
  99. gap/pkg/semigroups/gap/elements/semiringmat.gd +136 -0
  100. gap/pkg/semigroups/gap/elements/semiringmat.gi +717 -0
  101. gap/pkg/semigroups/gap/elements/star.gd +21 -0
  102. gap/pkg/semigroups/gap/elements/star.gi +21 -0
  103. gap/pkg/semigroups/gap/elements/trans.gd +13 -0
  104. gap/pkg/semigroups/gap/elements/trans.gi +50 -0
  105. gap/pkg/semigroups/gap/fp/freeband.gd +22 -0
  106. gap/pkg/semigroups/gap/fp/freeband.gi +502 -0
  107. gap/pkg/semigroups/gap/fp/freeinverse.gd +30 -0
  108. gap/pkg/semigroups/gap/fp/freeinverse.gi +465 -0
  109. gap/pkg/semigroups/gap/fp/tietze.gd +89 -0
  110. gap/pkg/semigroups/gap/fp/tietze.gi +1578 -0
  111. gap/pkg/semigroups/gap/fp/word.gd +15 -0
  112. gap/pkg/semigroups/gap/fp/word.gi +67 -0
  113. gap/pkg/semigroups/gap/greens/acting-inverse.gi +774 -0
  114. gap/pkg/semigroups/gap/greens/acting-regular.gi +553 -0
  115. gap/pkg/semigroups/gap/greens/acting.gd +81 -0
  116. gap/pkg/semigroups/gap/greens/acting.gi +2433 -0
  117. gap/pkg/semigroups/gap/greens/froidure-pin.gd +25 -0
  118. gap/pkg/semigroups/gap/greens/froidure-pin.gi +741 -0
  119. gap/pkg/semigroups/gap/greens/generic.gd +117 -0
  120. gap/pkg/semigroups/gap/greens/generic.gi +630 -0
  121. gap/pkg/semigroups/gap/ideals/acting.gd +17 -0
  122. gap/pkg/semigroups/gap/ideals/acting.gi +1155 -0
  123. gap/pkg/semigroups/gap/ideals/froidure-pin.gd +11 -0
  124. gap/pkg/semigroups/gap/ideals/froidure-pin.gi +105 -0
  125. gap/pkg/semigroups/gap/ideals/ideals.gd +45 -0
  126. gap/pkg/semigroups/gap/ideals/ideals.gi +442 -0
  127. gap/pkg/semigroups/gap/ideals/lambda-rho.gd +16 -0
  128. gap/pkg/semigroups/gap/ideals/lambda-rho.gi +614 -0
  129. gap/pkg/semigroups/gap/libsemigroups/cong.gd +24 -0
  130. gap/pkg/semigroups/gap/libsemigroups/cong.gi +431 -0
  131. gap/pkg/semigroups/gap/libsemigroups/fpsemi.gd +16 -0
  132. gap/pkg/semigroups/gap/libsemigroups/fpsemi.gi +53 -0
  133. gap/pkg/semigroups/gap/libsemigroups/froidure-pin.gd +17 -0
  134. gap/pkg/semigroups/gap/libsemigroups/froidure-pin.gi +945 -0
  135. gap/pkg/semigroups/gap/libsemigroups/sims1.gd +38 -0
  136. gap/pkg/semigroups/gap/libsemigroups/sims1.gi +308 -0
  137. gap/pkg/semigroups/gap/main/acting.gd +36 -0
  138. gap/pkg/semigroups/gap/main/acting.gi +779 -0
  139. gap/pkg/semigroups/gap/main/froidure-pin.gd +72 -0
  140. gap/pkg/semigroups/gap/main/froidure-pin.gi +655 -0
  141. gap/pkg/semigroups/gap/main/graded.gd +26 -0
  142. gap/pkg/semigroups/gap/main/graded.gi +355 -0
  143. gap/pkg/semigroups/gap/main/lambda-rho.gd +29 -0
  144. gap/pkg/semigroups/gap/main/lambda-rho.gi +514 -0
  145. gap/pkg/semigroups/gap/main/orbits.gd +24 -0
  146. gap/pkg/semigroups/gap/main/orbits.gi +512 -0
  147. gap/pkg/semigroups/gap/main/semiact.gd +20 -0
  148. gap/pkg/semigroups/gap/main/semiact.gi +821 -0
  149. gap/pkg/semigroups/gap/main/setup.gd +61 -0
  150. gap/pkg/semigroups/gap/main/setup.gi +1094 -0
  151. gap/pkg/semigroups/gap/obsolete.gd +9 -0
  152. gap/pkg/semigroups/gap/obsolete.gi +14 -0
  153. gap/pkg/semigroups/gap/options.g +55 -0
  154. gap/pkg/semigroups/gap/semigroups/grpperm.gd +12 -0
  155. gap/pkg/semigroups/gap/semigroups/grpperm.gi +177 -0
  156. gap/pkg/semigroups/gap/semigroups/semibipart.gd +28 -0
  157. gap/pkg/semigroups/gap/semigroups/semibipart.gi +570 -0
  158. gap/pkg/semigroups/gap/semigroups/semiboolmat.gd +20 -0
  159. gap/pkg/semigroups/gap/semigroups/semiboolmat.gi +104 -0
  160. gap/pkg/semigroups/gap/semigroups/semicons.gd +52 -0
  161. gap/pkg/semigroups/gap/semigroups/semicons.gi +1194 -0
  162. gap/pkg/semigroups/gap/semigroups/semidp.gd +13 -0
  163. gap/pkg/semigroups/gap/semigroups/semidp.gi +509 -0
  164. gap/pkg/semigroups/gap/semigroups/semieunit.gd +126 -0
  165. gap/pkg/semigroups/gap/semigroups/semieunit.gi +889 -0
  166. gap/pkg/semigroups/gap/semigroups/semiex.gd +104 -0
  167. gap/pkg/semigroups/gap/semigroups/semiex.gi +1590 -0
  168. gap/pkg/semigroups/gap/semigroups/semiffmat.gd +37 -0
  169. gap/pkg/semigroups/gap/semigroups/semiffmat.gi +565 -0
  170. gap/pkg/semigroups/gap/semigroups/semifp.gd +28 -0
  171. gap/pkg/semigroups/gap/semigroups/semifp.gi +1364 -0
  172. gap/pkg/semigroups/gap/semigroups/semigraph.gd +40 -0
  173. gap/pkg/semigroups/gap/semigroups/semigraph.gi +292 -0
  174. gap/pkg/semigroups/gap/semigroups/semigrp.gd +165 -0
  175. gap/pkg/semigroups/gap/semigroups/semigrp.gi +1225 -0
  176. gap/pkg/semigroups/gap/semigroups/semimaxplus.gd +72 -0
  177. gap/pkg/semigroups/gap/semigroups/semimaxplus.gi +710 -0
  178. gap/pkg/semigroups/gap/semigroups/semintmat.gd +13 -0
  179. gap/pkg/semigroups/gap/semigroups/semintmat.gi +74 -0
  180. gap/pkg/semigroups/gap/semigroups/semipbr.gd +19 -0
  181. gap/pkg/semigroups/gap/semigroups/semipbr.gi +139 -0
  182. gap/pkg/semigroups/gap/semigroups/semipperm.gd +27 -0
  183. gap/pkg/semigroups/gap/semigroups/semipperm.gi +711 -0
  184. gap/pkg/semigroups/gap/semigroups/semiquo.gd +14 -0
  185. gap/pkg/semigroups/gap/semigroups/semiquo.gi +97 -0
  186. gap/pkg/semigroups/gap/semigroups/semiringmat.gd +16 -0
  187. gap/pkg/semigroups/gap/semigroups/semiringmat.gi +21 -0
  188. gap/pkg/semigroups/gap/semigroups/semirms.gd +19 -0
  189. gap/pkg/semigroups/gap/semigroups/semirms.gi +977 -0
  190. gap/pkg/semigroups/gap/semigroups/semitrans.gd +49 -0
  191. gap/pkg/semigroups/gap/semigroups/semitrans.gi +909 -0
  192. gap/pkg/semigroups/gap/tools/display.gd +24 -0
  193. gap/pkg/semigroups/gap/tools/display.gi +749 -0
  194. gap/pkg/semigroups/gap/tools/io.gd +17 -0
  195. gap/pkg/semigroups/gap/tools/io.gi +543 -0
  196. gap/pkg/semigroups/gap/tools/iterators.gd +16 -0
  197. gap/pkg/semigroups/gap/tools/iterators.gi +253 -0
  198. gap/pkg/semigroups/gap/tools/utils.gd +19 -0
  199. gap/pkg/semigroups/gap/tools/utils.gi +756 -0
  200. gap/pkg/semigroups/gapbind14/.ccls +18 -0
  201. gap/pkg/semigroups/gapbind14/.clang-format +104 -0
  202. gap/pkg/semigroups/gapbind14/CPPLINT.cfg +5 -0
  203. gap/pkg/semigroups/gapbind14/LICENSE +674 -0
  204. gap/pkg/semigroups/gapbind14/README.md +76 -0
  205. gap/pkg/semigroups/gapbind14/demo/.gitignore +4 -0
  206. gap/pkg/semigroups/gapbind14/demo/LICENSE +293 -0
  207. gap/pkg/semigroups/gapbind14/demo/Makefile.gappkg +220 -0
  208. gap/pkg/semigroups/gapbind14/demo/Makefile.in +19 -0
  209. gap/pkg/semigroups/gapbind14/demo/PackageInfo.g +87 -0
  210. gap/pkg/semigroups/gapbind14/demo/README.md +17 -0
  211. gap/pkg/semigroups/gapbind14/demo/configure +34 -0
  212. gap/pkg/semigroups/gapbind14/demo/gap/gapbind_demo.gd +19 -0
  213. gap/pkg/semigroups/gapbind14/demo/gap/gapbind_demo.gi +10 -0
  214. gap/pkg/semigroups/gapbind14/demo/init.g +16 -0
  215. gap/pkg/semigroups/gapbind14/demo/makedoc.g +10 -0
  216. gap/pkg/semigroups/gapbind14/demo/read.g +6 -0
  217. gap/pkg/semigroups/gapbind14/demo/src/gapbind_demo.cc +142 -0
  218. gap/pkg/semigroups/gapbind14/demo/tst/testall.g +12 -0
  219. gap/pkg/semigroups/gapbind14/include/gapbind14/cpp_fn.hpp +223 -0
  220. gap/pkg/semigroups/gapbind14/include/gapbind14/gap_include.hpp +26 -0
  221. gap/pkg/semigroups/gapbind14/include/gapbind14/gapbind14.hpp +445 -0
  222. gap/pkg/semigroups/gapbind14/include/gapbind14/tame_free_fn.hpp +420 -0
  223. gap/pkg/semigroups/gapbind14/include/gapbind14/tame_mem_fn.hpp +556 -0
  224. gap/pkg/semigroups/gapbind14/include/gapbind14/to_cpp.hpp +162 -0
  225. gap/pkg/semigroups/gapbind14/include/gapbind14/to_gap.hpp +158 -0
  226. gap/pkg/semigroups/gapbind14/src/.clang-format +108 -0
  227. gap/pkg/semigroups/gapbind14/src/gapbind14.cpp +334 -0
  228. gap/pkg/semigroups/init.g +150 -0
  229. gap/pkg/semigroups/m4/ax_append_flag.m4 +50 -0
  230. gap/pkg/semigroups/m4/ax_check_compile_flag.m4 +53 -0
  231. gap/pkg/semigroups/m4/ax_check_hpcombi.m4 +121 -0
  232. gap/pkg/semigroups/m4/ax_check_libsemigroup.m4 +68 -0
  233. gap/pkg/semigroups/m4/ax_compare_version.m4 +177 -0
  234. gap/pkg/semigroups/m4/ax_cxx_compile_stdcxx.m4 +1009 -0
  235. gap/pkg/semigroups/m4/ax_cxx_compile_stdcxx_14.m4 +34 -0
  236. gap/pkg/semigroups/m4/ax_prefix_config_h.m4 +203 -0
  237. gap/pkg/semigroups/m4/ax_pthread.m4 +522 -0
  238. gap/pkg/semigroups/m4/find_gap.m4 +94 -0
  239. gap/pkg/semigroups/makedoc.g +153 -0
  240. gap/pkg/semigroups/prerequisites.sh +62 -0
  241. gap/pkg/semigroups/read.g +105 -0
  242. gap/pkg/semigroups/release.toml +6 -0
  243. gap/pkg/semigroups/tst/extreme/README +2 -0
  244. gap/pkg/semigroups/tst/extreme/attrinv.tst +703 -0
  245. gap/pkg/semigroups/tst/extreme/bipart.tst +2803 -0
  246. gap/pkg/semigroups/tst/extreme/closure.tst +652 -0
  247. gap/pkg/semigroups/tst/extreme/cong.tst +286 -0
  248. gap/pkg/semigroups/tst/extreme/conginv.tst +43 -0
  249. gap/pkg/semigroups/tst/extreme/examples.tst +2449 -0
  250. gap/pkg/semigroups/tst/extreme/freeband.tst +37 -0
  251. gap/pkg/semigroups/tst/extreme/greens-acting-regular.tst +27 -0
  252. gap/pkg/semigroups/tst/extreme/greens-acting.tst +1999 -0
  253. gap/pkg/semigroups/tst/extreme/ideals.tst +858 -0
  254. gap/pkg/semigroups/tst/extreme/inverse.tst +1025 -0
  255. gap/pkg/semigroups/tst/extreme/maximal.tst +856 -0
  256. gap/pkg/semigroups/tst/extreme/misc.tst +4236 -0
  257. gap/pkg/semigroups/tst/extreme/monoid_pkg.tst +1488 -0
  258. gap/pkg/semigroups/tst/extreme/properties.tst +914 -0
  259. gap/pkg/semigroups/tst/extreme/semibipart.tst +2837 -0
  260. gap/pkg/semigroups/tst/extreme/semieunit.tst +49 -0
  261. gap/pkg/semigroups/tst/extreme/semiffmat.tst +353 -0
  262. gap/pkg/semigroups/tst/extreme/semigroups.tst +245 -0
  263. gap/pkg/semigroups/tst/extreme/semiiter.tst +58 -0
  264. gap/pkg/semigroups/tst/extreme/semirms.tst +1091 -0
  265. gap/pkg/semigroups/tst/extreme/transform.tst +305 -0
  266. gap/pkg/semigroups/tst/extreme/translat.tst +44 -0
  267. gap/pkg/semigroups/tst/standard/README +2 -0
  268. gap/pkg/semigroups/tst/standard/attributes/acting.tst +388 -0
  269. gap/pkg/semigroups/tst/standard/attributes/attr.tst +2404 -0
  270. gap/pkg/semigroups/tst/standard/attributes/dual.tst +308 -0
  271. gap/pkg/semigroups/tst/standard/attributes/factor.tst +629 -0
  272. gap/pkg/semigroups/tst/standard/attributes/homomorph.tst +1134 -0
  273. gap/pkg/semigroups/tst/standard/attributes/inverse.tst +1521 -0
  274. gap/pkg/semigroups/tst/standard/attributes/isomorph.tst +435 -0
  275. gap/pkg/semigroups/tst/standard/attributes/isorms.tst +1147 -0
  276. gap/pkg/semigroups/tst/standard/attributes/maximal.tst +853 -0
  277. gap/pkg/semigroups/tst/standard/attributes/properties.tst +2028 -0
  278. gap/pkg/semigroups/tst/standard/attributes/semifp.tst +53 -0
  279. gap/pkg/semigroups/tst/standard/attributes/translat.tst +796 -0
  280. gap/pkg/semigroups/tst/standard/congruences/cong.tst +1044 -0
  281. gap/pkg/semigroups/tst/standard/congruences/conginv.tst +292 -0
  282. gap/pkg/semigroups/tst/standard/congruences/conglatt.tst +421 -0
  283. gap/pkg/semigroups/tst/standard/congruences/congpairs.tst +1011 -0
  284. gap/pkg/semigroups/tst/standard/congruences/congrees.tst +288 -0
  285. gap/pkg/semigroups/tst/standard/congruences/congrms.tst +701 -0
  286. gap/pkg/semigroups/tst/standard/congruences/congsemigraph.tst +422 -0
  287. gap/pkg/semigroups/tst/standard/congruences/congsimple.tst +311 -0
  288. gap/pkg/semigroups/tst/standard/congruences/conguniv.tst +259 -0
  289. gap/pkg/semigroups/tst/standard/congruences/congwordgraph.tst +330 -0
  290. gap/pkg/semigroups/tst/standard/elements/bipart.tst +783 -0
  291. gap/pkg/semigroups/tst/standard/elements/blocks.tst +166 -0
  292. gap/pkg/semigroups/tst/standard/elements/boolmat.tst +608 -0
  293. gap/pkg/semigroups/tst/standard/elements/elements.tst +117 -0
  294. gap/pkg/semigroups/tst/standard/elements/ffmat.tst +349 -0
  295. gap/pkg/semigroups/tst/standard/elements/maxplusmat.tst +613 -0
  296. gap/pkg/semigroups/tst/standard/elements/pbr.tst +506 -0
  297. gap/pkg/semigroups/tst/standard/elements/pperm.tst +32 -0
  298. gap/pkg/semigroups/tst/standard/elements/semiringmat.tst +601 -0
  299. gap/pkg/semigroups/tst/standard/elements/trans.tst +58 -0
  300. gap/pkg/semigroups/tst/standard/fp/freeband.tst +311 -0
  301. gap/pkg/semigroups/tst/standard/fp/freeinverse.tst +147 -0
  302. gap/pkg/semigroups/tst/standard/fp/tietze.tst +780 -0
  303. gap/pkg/semigroups/tst/standard/fp/word.tst +106 -0
  304. gap/pkg/semigroups/tst/standard/greens/acting-inverse.tst +545 -0
  305. gap/pkg/semigroups/tst/standard/greens/acting-regular.tst +396 -0
  306. gap/pkg/semigroups/tst/standard/greens/acting.tst +2033 -0
  307. gap/pkg/semigroups/tst/standard/greens/froidure-pin.tst +1831 -0
  308. gap/pkg/semigroups/tst/standard/greens/generic.tst +1436 -0
  309. gap/pkg/semigroups/tst/standard/ideals/acting.tst +279 -0
  310. gap/pkg/semigroups/tst/standard/ideals/froidure-pin.tst +178 -0
  311. gap/pkg/semigroups/tst/standard/ideals/ideals.tst +380 -0
  312. gap/pkg/semigroups/tst/standard/libsemigroups/cong.tst +310 -0
  313. gap/pkg/semigroups/tst/standard/libsemigroups/froidure-pin.tst +778 -0
  314. gap/pkg/semigroups/tst/standard/libsemigroups/sims1.tst +379 -0
  315. gap/pkg/semigroups/tst/standard/main/acting.tst +411 -0
  316. gap/pkg/semigroups/tst/standard/main/froidure-pin.tst +392 -0
  317. gap/pkg/semigroups/tst/standard/main/semiact.tst +203 -0
  318. gap/pkg/semigroups/tst/standard/main/setup.tst +1144 -0
  319. gap/pkg/semigroups/tst/standard/obsolete.tst +19 -0
  320. gap/pkg/semigroups/tst/standard/options.tst +54 -0
  321. gap/pkg/semigroups/tst/standard/semigroups/grpperm.tst +581 -0
  322. gap/pkg/semigroups/tst/standard/semigroups/semibipart.tst +2635 -0
  323. gap/pkg/semigroups/tst/standard/semigroups/semiboolmat.tst +1871 -0
  324. gap/pkg/semigroups/tst/standard/semigroups/semicons.tst +1173 -0
  325. gap/pkg/semigroups/tst/standard/semigroups/semidp.tst +739 -0
  326. gap/pkg/semigroups/tst/standard/semigroups/semieunit.tst +339 -0
  327. gap/pkg/semigroups/tst/standard/semigroups/semiex.tst +2055 -0
  328. gap/pkg/semigroups/tst/standard/semigroups/semiffmat.tst +746 -0
  329. gap/pkg/semigroups/tst/standard/semigroups/semifp.tst +2702 -0
  330. gap/pkg/semigroups/tst/standard/semigroups/semigraph.tst +133 -0
  331. gap/pkg/semigroups/tst/standard/semigroups/semigrp.tst +1112 -0
  332. gap/pkg/semigroups/tst/standard/semigroups/semimaxplus.tst +654 -0
  333. gap/pkg/semigroups/tst/standard/semigroups/semipbr.tst +2142 -0
  334. gap/pkg/semigroups/tst/standard/semigroups/semipperm.tst +2169 -0
  335. gap/pkg/semigroups/tst/standard/semigroups/semiquo.tst +278 -0
  336. gap/pkg/semigroups/tst/standard/semigroups/semirms.tst +3010 -0
  337. gap/pkg/semigroups/tst/standard/semigroups/semitrans.tst +2758 -0
  338. gap/pkg/semigroups/tst/standard/tools/display.tst +1040 -0
  339. gap/pkg/semigroups/tst/standard/tools/io.tst +363 -0
  340. gap/pkg/semigroups/tst/testinstall.tst +1815 -0
  341. gap/pkg/semigroups/tst/teststandard.g +22 -0
  342. gap/pkg/semigroups/tst/workspaces/load-workspace.tst +142 -0
  343. gap/pkg/semigroups/tst/workspaces/load.g +11 -0
  344. gap/pkg/semigroups/tst/workspaces/save-workspace.tst +166 -0
  345. gap/pkg/semigroups/tst/workspaces/save.g +14 -0
  346. passagemath_gap_pkg_semigroups-10.6.29.dist-info/METADATA +93 -0
  347. passagemath_gap_pkg_semigroups-10.6.29.dist-info/METADATA.bak +94 -0
  348. passagemath_gap_pkg_semigroups-10.6.29.dist-info/RECORD +354 -0
  349. passagemath_gap_pkg_semigroups-10.6.29.dist-info/WHEEL +6 -0
  350. passagemath_gap_pkg_semigroups-10.6.29.dist-info/top_level.txt +1 -0
  351. passagemath_gap_pkg_semigroups.dylibs/libsemigroups.2.dylib +0 -0
  352. sage/all__sagemath_gap_pkg_semigroups.py +1 -0
  353. sage/libs/all__sagemath_gap_pkg_semigroups.py +1 -0
  354. sage/libs/gap_pkg_semigroups.abi3.so +0 -0
gap/pkg/semigroups/tst/standard/libsemigroups/froidure-pin.tst ADDED
@@ -0,0 +1,778 @@
1
+ #############################################################################
2
+ ##
3
+ #W standard/libsemigroups/froidure-pin.tst
4
+ #Y Copyright (C) 2022 James D. Mitchell
5
+ ##
6
+ ## Licensing information can be found in the README file of this package.
7
+ ##
8
+ #############################################################################
9
+ ##
10
+
11
+ #@local F, N, R, S, acting, add_generator, at, closure, coll, copy
12
+ #@local current_position, en, enumerate, factorisation, fast_product
13
+ #@local final_letter, finished, first_letter, generator, idempotents
14
+ #@local is_idempotent, it, left_cayley_graph, list, make, nr
15
+ #@local number_of_generators, number_of_idempotents, opts, position
16
+ #@local position_to_sorted_position, prefix, rels, right_cayley_graph, rules
17
+ #@local size, sorted_at, sorted_position, suffix, x
18
+ gap> START_TEST("Semigroups package: standard/libsemigroups/froidure-pin.tst");
19
+ gap> LoadPackage("semigroups", false);;
20
+
21
+ #
22
+ gap> SEMIGROUPS.StartTest();
23
+
24
+ # FroidurePinMemFnRec
25
+ gap> FroidurePinMemFnRec(FullTransformationSemigroup(1));
26
+ rec( add_generator := function( arg1, arg2 ) ... end,
27
+ at := function( arg1, arg2 ) ... end,
28
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
29
+ current_position := function( arg1, arg2 ) ... end,
30
+ enumerate := function( arg1, arg2 ) ... end,
31
+ factorisation := function( arg1, arg2 ) ... end,
32
+ fast_product := function( arg1, arg2, arg3 ) ... end,
33
+ final_letter := function( arg1, arg2 ) ... end,
34
+ finished := function( arg1 ) ... end,
35
+ first_letter := function( arg1, arg2 ) ... end,
36
+ generator := function( arg1, arg2 ) ... end,
37
+ idempotents := function( arg1 ) ... end,
38
+ is_idempotent := function( arg1, arg2 ) ... end,
39
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
40
+ number_of_generators := function( arg1 ) ... end,
41
+ number_of_idempotents := function( arg1 ) ... end,
42
+ position := function( arg1, arg2 ) ... end,
43
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
44
+ prefix := function( arg1, arg2 ) ... end,
45
+ right_cayley_graph := function( arg1 ) ... end,
46
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
47
+ sorted_at := function( arg1, arg2 ) ... end,
48
+ sorted_position := function( arg1, arg2 ) ... end,
49
+ suffix := function( arg1, arg2 ) ... end )
50
+ gap> FroidurePinMemFnRec(Semigroup(ConstantTransformation(17, 1)));
51
+ rec( add_generator := function( arg1, arg2 ) ... end,
52
+ at := function( arg1, arg2 ) ... end,
53
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
54
+ current_position := function( arg1, arg2 ) ... end,
55
+ enumerate := function( arg1, arg2 ) ... end,
56
+ factorisation := function( arg1, arg2 ) ... end,
57
+ fast_product := function( arg1, arg2, arg3 ) ... end,
58
+ final_letter := function( arg1, arg2 ) ... end,
59
+ finished := function( arg1 ) ... end,
60
+ first_letter := function( arg1, arg2 ) ... end,
61
+ generator := function( arg1, arg2 ) ... end,
62
+ idempotents := function( arg1 ) ... end,
63
+ is_idempotent := function( arg1, arg2 ) ... end,
64
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
65
+ number_of_generators := function( arg1 ) ... end,
66
+ number_of_idempotents := function( arg1 ) ... end,
67
+ position := function( arg1, arg2 ) ... end,
68
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
69
+ prefix := function( arg1, arg2 ) ... end,
70
+ right_cayley_graph := function( arg1 ) ... end,
71
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
72
+ sorted_at := function( arg1, arg2 ) ... end,
73
+ sorted_position := function( arg1, arg2 ) ... end,
74
+ suffix := function( arg1, arg2 ) ... end )
75
+ gap> FroidurePinMemFnRec(Semigroup(ConstantTransformation(65537, 1)));
76
+ rec( add_generator := function( arg1, arg2 ) ... end,
77
+ at := function( arg1, arg2 ) ... end,
78
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
79
+ current_position := function( arg1, arg2 ) ... end,
80
+ enumerate := function( arg1, arg2 ) ... end,
81
+ factorisation := function( arg1, arg2 ) ... end,
82
+ fast_product := function( arg1, arg2, arg3 ) ... end,
83
+ final_letter := function( arg1, arg2 ) ... end,
84
+ finished := function( arg1 ) ... end,
85
+ first_letter := function( arg1, arg2 ) ... end,
86
+ generator := function( arg1, arg2 ) ... end,
87
+ idempotents := function( arg1 ) ... end,
88
+ is_idempotent := function( arg1, arg2 ) ... end,
89
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
90
+ number_of_generators := function( arg1 ) ... end,
91
+ number_of_idempotents := function( arg1 ) ... end,
92
+ position := function( arg1, arg2 ) ... end,
93
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
94
+ prefix := function( arg1, arg2 ) ... end,
95
+ right_cayley_graph := function( arg1 ) ... end,
96
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
97
+ sorted_at := function( arg1, arg2 ) ... end,
98
+ sorted_position := function( arg1, arg2 ) ... end,
99
+ suffix := function( arg1, arg2 ) ... end )
100
+ gap> FroidurePinMemFnRec(SymmetricInverseMonoid(1));
101
+ rec( add_generator := function( arg1, arg2 ) ... end,
102
+ at := function( arg1, arg2 ) ... end,
103
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
104
+ current_position := function( arg1, arg2 ) ... end,
105
+ enumerate := function( arg1, arg2 ) ... end,
106
+ factorisation := function( arg1, arg2 ) ... end,
107
+ fast_product := function( arg1, arg2, arg3 ) ... end,
108
+ final_letter := function( arg1, arg2 ) ... end,
109
+ finished := function( arg1 ) ... end,
110
+ first_letter := function( arg1, arg2 ) ... end,
111
+ generator := function( arg1, arg2 ) ... end,
112
+ idempotents := function( arg1 ) ... end,
113
+ is_idempotent := function( arg1, arg2 ) ... end,
114
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
115
+ number_of_generators := function( arg1 ) ... end,
116
+ number_of_idempotents := function( arg1 ) ... end,
117
+ position := function( arg1, arg2 ) ... end,
118
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
119
+ prefix := function( arg1, arg2 ) ... end,
120
+ right_cayley_graph := function( arg1 ) ... end,
121
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
122
+ sorted_at := function( arg1, arg2 ) ... end,
123
+ sorted_position := function( arg1, arg2 ) ... end,
124
+ suffix := function( arg1, arg2 ) ... end )
125
+ gap> FroidurePinMemFnRec(SymmetricInverseMonoid(17));
126
+ rec( add_generator := function( arg1, arg2 ) ... end,
127
+ at := function( arg1, arg2 ) ... end,
128
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
129
+ current_position := function( arg1, arg2 ) ... end,
130
+ enumerate := function( arg1, arg2 ) ... end,
131
+ factorisation := function( arg1, arg2 ) ... end,
132
+ fast_product := function( arg1, arg2, arg3 ) ... end,
133
+ final_letter := function( arg1, arg2 ) ... end,
134
+ finished := function( arg1 ) ... end,
135
+ first_letter := function( arg1, arg2 ) ... end,
136
+ generator := function( arg1, arg2 ) ... end,
137
+ idempotents := function( arg1 ) ... end,
138
+ is_idempotent := function( arg1, arg2 ) ... end,
139
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
140
+ number_of_generators := function( arg1 ) ... end,
141
+ number_of_idempotents := function( arg1 ) ... end,
142
+ position := function( arg1, arg2 ) ... end,
143
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
144
+ prefix := function( arg1, arg2 ) ... end,
145
+ right_cayley_graph := function( arg1 ) ... end,
146
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
147
+ sorted_at := function( arg1, arg2 ) ... end,
148
+ sorted_position := function( arg1, arg2 ) ... end,
149
+ suffix := function( arg1, arg2 ) ... end )
150
+ gap> FroidurePinMemFnRec(SymmetricInverseMonoid(65537));
151
+ rec( add_generator := function( arg1, arg2 ) ... end,
152
+ at := function( arg1, arg2 ) ... end,
153
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
154
+ current_position := function( arg1, arg2 ) ... end,
155
+ enumerate := function( arg1, arg2 ) ... end,
156
+ factorisation := function( arg1, arg2 ) ... end,
157
+ fast_product := function( arg1, arg2, arg3 ) ... end,
158
+ final_letter := function( arg1, arg2 ) ... end,
159
+ finished := function( arg1 ) ... end,
160
+ first_letter := function( arg1, arg2 ) ... end,
161
+ generator := function( arg1, arg2 ) ... end,
162
+ idempotents := function( arg1 ) ... end,
163
+ is_idempotent := function( arg1, arg2 ) ... end,
164
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
165
+ number_of_generators := function( arg1 ) ... end,
166
+ number_of_idempotents := function( arg1 ) ... end,
167
+ position := function( arg1, arg2 ) ... end,
168
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
169
+ prefix := function( arg1, arg2 ) ... end,
170
+ right_cayley_graph := function( arg1 ) ... end,
171
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
172
+ sorted_at := function( arg1, arg2 ) ... end,
173
+ sorted_position := function( arg1, arg2 ) ... end,
174
+ suffix := function( arg1, arg2 ) ... end )
175
+ gap> FroidurePinMemFnRec(FullBooleanMatMonoid(2));
176
+ rec( add_generator := function( arg1, arg2 ) ... end,
177
+ at := function( arg1, arg2 ) ... end,
178
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
179
+ current_position := function( arg1, arg2 ) ... end,
180
+ enumerate := function( arg1, arg2 ) ... end,
181
+ factorisation := function( arg1, arg2 ) ... end,
182
+ fast_product := function( arg1, arg2, arg3 ) ... end,
183
+ final_letter := function( arg1, arg2 ) ... end,
184
+ finished := function( arg1 ) ... end,
185
+ first_letter := function( arg1, arg2 ) ... end,
186
+ generator := function( arg1, arg2 ) ... end,
187
+ idempotents := function( arg1 ) ... end,
188
+ is_idempotent := function( arg1, arg2 ) ... end,
189
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
190
+ number_of_generators := function( arg1 ) ... end,
191
+ number_of_idempotents := function( arg1 ) ... end,
192
+ position := function( arg1, arg2 ) ... end,
193
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
194
+ prefix := function( arg1, arg2 ) ... end,
195
+ right_cayley_graph := function( arg1 ) ... end,
196
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
197
+ sorted_at := function( arg1, arg2 ) ... end,
198
+ sorted_position := function( arg1, arg2 ) ... end,
199
+ suffix := function( arg1, arg2 ) ... end )
200
+ gap> FroidurePinMemFnRec(RegularBooleanMatMonoid(9));
201
+ rec( add_generator := function( arg1, arg2 ) ... end,
202
+ at := function( arg1, arg2 ) ... end,
203
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
204
+ current_position := function( arg1, arg2 ) ... end,
205
+ enumerate := function( arg1, arg2 ) ... end,
206
+ factorisation := function( arg1, arg2 ) ... end,
207
+ fast_product := function( arg1, arg2, arg3 ) ... end,
208
+ final_letter := function( arg1, arg2 ) ... end,
209
+ finished := function( arg1 ) ... end,
210
+ first_letter := function( arg1, arg2 ) ... end,
211
+ generator := function( arg1, arg2 ) ... end,
212
+ idempotents := function( arg1 ) ... end,
213
+ is_idempotent := function( arg1, arg2 ) ... end,
214
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
215
+ number_of_generators := function( arg1 ) ... end,
216
+ number_of_idempotents := function( arg1 ) ... end,
217
+ position := function( arg1, arg2 ) ... end,
218
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
219
+ prefix := function( arg1, arg2 ) ... end,
220
+ right_cayley_graph := function( arg1 ) ... end,
221
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
222
+ sorted_at := function( arg1, arg2 ) ... end,
223
+ sorted_position := function( arg1, arg2 ) ... end,
224
+ suffix := function( arg1, arg2 ) ... end )
225
+ gap> FroidurePinMemFnRec(FullTropicalMinPlusMonoid(2, 2));
226
+ rec( add_generator := function( arg1, arg2 ) ... end,
227
+ at := function( arg1, arg2 ) ... end,
228
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
229
+ current_position := function( arg1, arg2 ) ... end,
230
+ enumerate := function( arg1, arg2 ) ... end,
231
+ factorisation := function( arg1, arg2 ) ... end,
232
+ fast_product := function( arg1, arg2, arg3 ) ... end,
233
+ final_letter := function( arg1, arg2 ) ... end,
234
+ finished := function( arg1 ) ... end,
235
+ first_letter := function( arg1, arg2 ) ... end,
236
+ generator := function( arg1, arg2 ) ... end,
237
+ idempotents := function( arg1 ) ... end,
238
+ is_idempotent := function( arg1, arg2 ) ... end,
239
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
240
+ number_of_generators := function( arg1 ) ... end,
241
+ number_of_idempotents := function( arg1 ) ... end,
242
+ position := function( arg1, arg2 ) ... end,
243
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
244
+ prefix := function( arg1, arg2 ) ... end,
245
+ right_cayley_graph := function( arg1 ) ... end,
246
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
247
+ sorted_at := function( arg1, arg2 ) ... end,
248
+ sorted_position := function( arg1, arg2 ) ... end,
249
+ suffix := function( arg1, arg2 ) ... end )
250
+ gap> FroidurePinMemFnRec(FullTropicalMaxPlusMonoid(2, 2));
251
+ rec( add_generator := function( arg1, arg2 ) ... end,
252
+ at := function( arg1, arg2 ) ... end,
253
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
254
+ current_position := function( arg1, arg2 ) ... end,
255
+ enumerate := function( arg1, arg2 ) ... end,
256
+ factorisation := function( arg1, arg2 ) ... end,
257
+ fast_product := function( arg1, arg2, arg3 ) ... end,
258
+ final_letter := function( arg1, arg2 ) ... end,
259
+ finished := function( arg1 ) ... end,
260
+ first_letter := function( arg1, arg2 ) ... end,
261
+ generator := function( arg1, arg2 ) ... end,
262
+ idempotents := function( arg1 ) ... end,
263
+ is_idempotent := function( arg1, arg2 ) ... end,
264
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
265
+ number_of_generators := function( arg1 ) ... end,
266
+ number_of_idempotents := function( arg1 ) ... end,
267
+ position := function( arg1, arg2 ) ... end,
268
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
269
+ prefix := function( arg1, arg2 ) ... end,
270
+ right_cayley_graph := function( arg1 ) ... end,
271
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
272
+ sorted_at := function( arg1, arg2 ) ... end,
273
+ sorted_position := function( arg1, arg2 ) ... end,
274
+ suffix := function( arg1, arg2 ) ... end )
275
+ gap> FroidurePinMemFnRec(Semigroup(Matrix(IsProjectiveMaxPlusMatrix, [[1]])));
276
+ rec( add_generator := function( arg1, arg2 ) ... end,
277
+ at := function( arg1, arg2 ) ... end,
278
+ closure := function( arg1, arg2 ) ... end, copy := function( arg1 ) ... end,
279
+ current_position := function( arg1, arg2 ) ... end,
280
+ enumerate := function( arg1, arg2 ) ... end,
281
+ factorisation := function( arg1, arg2 ) ... end,
282
+ fast_product := function( arg1, arg2, arg3 ) ... end,
283
+ final_letter := function( arg1, arg2 ) ... end,
284
+ finished := function( arg1 ) ... end,
285
+ first_letter := function( arg1, arg2 ) ... end,
286
+ generator := function( arg1, arg2 ) ... end,
287
+ idempotents := function( arg1 ) ... end,
288
+ is_idempotent := function( arg1, arg2 ) ... end,
289
+ left_cayley_graph := function( arg1 ) ... end, make := function( ) ... end,
290
+ number_of_generators := function( arg1 ) ... end,
291
+ number_of_idempotents := function( arg1 ) ... end,
292
+ position := function( arg1, arg2 ) ... end,
293
+ position_to_sorted_position := function( arg1, arg2 ) ... end,
294
+ prefix := function( arg1, arg2 ) ... end,
295
+ right_cayley_graph := function( arg1 ) ... end,
296
+ rules := function( arg1 ) ... end, size := function( arg1 ) ... end,
297
+ sorted_at := function( arg1, arg2 ) ... end,
298
+ sorted_position := function( arg1, arg2 ) ... end,
299
+ suffix := function( arg1, arg2 ) ... end )
300
+
301
+ # HasLibsemigroupsFroidurePin
302
+ gap> S := FullTransformationMonoid(2);
303
+ <full transformation monoid of degree 2>
304
+ gap> HasLibsemigroupsFroidurePin(S);
305
+ false
306
+ gap> IsomorphismFpSemigroup(S);;
307
+ gap> HasLibsemigroupsFroidurePin(S);
308
+ true
309
+
310
+ # Size etc
311
+ gap> S := FullBooleanMatMonoid(2);
312
+ <monoid of 2x2 boolean matrices with 3 generators>
313
+ gap> Size(S);
314
+ 16
315
+ gap> IsFinite(S);
316
+ true
317
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
318
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
319
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
320
+ gap> Size(S);
321
+ infinity
322
+ gap> IsFinite(S);
323
+ false
324
+ gap> S := FullBooleanMatMonoid(2);
325
+ <monoid of 2x2 boolean matrices with 3 generators>
326
+ gap> IsFinite(S);
327
+ true
328
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
329
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
330
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
331
+ gap> IsFinite(S);
332
+ false
333
+ gap> S := Semigroup(Matrix(Integers,
334
+ > [[-1, 0, 0], [0, -1, 0], [0, 0, -1]]));
335
+ <commutative semigroup of 3x3 integer matrices with 1 generator>
336
+ gap> IsFinite(S);
337
+ true
338
+
339
+ # AsSet
340
+ gap> S := FullBooleanMatMonoid(2);
341
+ <monoid of 2x2 boolean matrices with 3 generators>
342
+ gap> AsSet(S);
343
+ [ Matrix(IsBooleanMat, [[0, 0], [0, 0]]),
344
+ Matrix(IsBooleanMat, [[0, 0], [0, 1]]),
345
+ Matrix(IsBooleanMat, [[0, 0], [1, 0]]),
346
+ Matrix(IsBooleanMat, [[0, 0], [1, 1]]),
347
+ Matrix(IsBooleanMat, [[0, 1], [0, 0]]),
348
+ Matrix(IsBooleanMat, [[0, 1], [0, 1]]),
349
+ Matrix(IsBooleanMat, [[0, 1], [1, 0]]),
350
+ Matrix(IsBooleanMat, [[0, 1], [1, 1]]),
351
+ Matrix(IsBooleanMat, [[1, 0], [0, 0]]),
352
+ Matrix(IsBooleanMat, [[1, 0], [0, 1]]),
353
+ Matrix(IsBooleanMat, [[1, 0], [1, 0]]),
354
+ Matrix(IsBooleanMat, [[1, 0], [1, 1]]),
355
+ Matrix(IsBooleanMat, [[1, 1], [0, 0]]),
356
+ Matrix(IsBooleanMat, [[1, 1], [0, 1]]),
357
+ Matrix(IsBooleanMat, [[1, 1], [1, 0]]),
358
+ Matrix(IsBooleanMat, [[1, 1], [1, 1]]) ]
359
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
360
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
361
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
362
+ gap> AsSet(S);
363
+ Error, the argument (a semigroup) is not finite
364
+ gap> S := SymmetricInverseMonoid(2);
365
+ <symmetric inverse monoid of degree 2>
366
+ gap> AsSet(S);
367
+ [ <empty partial perm>, <identity partial perm on [ 1 ]>, [1,2], [2,1],
368
+ <identity partial perm on [ 2 ]>, <identity partial perm on [ 1, 2 ]>,
369
+ (1,2) ]
370
+
371
+ # AsListCanonical
372
+ gap> S := FullBooleanMatMonoid(2);
373
+ <monoid of 2x2 boolean matrices with 3 generators>
374
+ gap> AsListCanonical(S);
375
+ [ Matrix(IsBooleanMat, [[1, 0], [0, 1]]),
376
+ Matrix(IsBooleanMat, [[0, 1], [1, 0]]),
377
+ Matrix(IsBooleanMat, [[1, 0], [1, 1]]),
378
+ Matrix(IsBooleanMat, [[1, 0], [0, 0]]),
379
+ Matrix(IsBooleanMat, [[1, 1], [1, 0]]),
380
+ Matrix(IsBooleanMat, [[0, 0], [1, 0]]),
381
+ Matrix(IsBooleanMat, [[0, 1], [1, 1]]),
382
+ Matrix(IsBooleanMat, [[1, 0], [1, 0]]),
383
+ Matrix(IsBooleanMat, [[0, 1], [0, 0]]),
384
+ Matrix(IsBooleanMat, [[1, 1], [0, 1]]),
385
+ Matrix(IsBooleanMat, [[0, 0], [0, 1]]),
386
+ Matrix(IsBooleanMat, [[1, 1], [1, 1]]),
387
+ Matrix(IsBooleanMat, [[0, 1], [0, 1]]),
388
+ Matrix(IsBooleanMat, [[1, 1], [0, 0]]),
389
+ Matrix(IsBooleanMat, [[0, 0], [0, 0]]),
390
+ Matrix(IsBooleanMat, [[0, 0], [1, 1]]) ]
391
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
392
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
393
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
394
+ gap> AsListCanonical(S);
395
+ Error, the argument (a semigroup) is not finite
396
+ gap> S := SymmetricInverseMonoid(2);
397
+ <symmetric inverse monoid of degree 2>
398
+ gap> AsListCanonical(S);
399
+ [ <identity partial perm on [ 1, 2 ]>, (1,2), <identity partial perm on [ 1 ]>
400
+ , [2,1], [1,2], <identity partial perm on [ 2 ]>, <empty partial perm> ]
401
+
402
+ # PositionCanonical
403
+ gap> S := FullBooleanMatMonoid(2);
404
+ <monoid of 2x2 boolean matrices with 3 generators>
405
+ gap> List(AsListCanonical(S), x -> PositionCanonical(S, x)) = [1 .. 16];
406
+ true
407
+ gap> PositionCanonical(S, Matrix(IsBooleanMat, [[0, 0, 0], [1, 0, 0], [1, 1, 1]]));
408
+ fail
409
+ gap> S := SymmetricInverseMonoid(2);;
410
+ gap> List(AsListCanonical(S), x -> PositionCanonical(S, x)) = [1 .. Size(S)];
411
+ true
412
+ gap> PositionCanonical(S, PartialPerm([1 .. 3]));
413
+ fail
414
+ gap> S := FullTransformationMonoid(2);;
415
+ gap> List(AsListCanonical(S), x -> PositionCanonical(S, x)) = [1 .. Size(S)];
416
+ true
417
+ gap> PositionCanonical(S, AsTransformation((1, 2, 3)));
418
+ fail
419
+ gap> F := FreeSemigroup(2);; AssignGeneratorVariables(F);;
420
+ gap> rels := [[s1 ^ 2, s1], [s1 * s2, s2], [s2 ^ 2, s2 * s1]];;
421
+ gap> S := F / rels;
422
+ <fp semigroup with 2 generators and 3 relations of length 12>
423
+ gap> PositionCanonical(S, 1);
424
+ fail
425
+
426
+ # Position
427
+ gap> S := FullBooleanMatMonoid(2);
428
+ <monoid of 2x2 boolean matrices with 3 generators>
429
+ gap> List(AsListCanonical(S), x -> Position(S, x)) = [1 .. 16];
430
+ true
431
+ gap> Position(S, Matrix(IsBooleanMat, [[0, 0, 0], [1, 0, 0], [1, 1, 1]]));
432
+ fail
433
+ gap> S := SymmetricInverseMonoid(2);;
434
+ gap> List(AsListCanonical(S), x -> Position(S, x)) = [1 .. Size(S)];
435
+ true
436
+ gap> Position(S, PartialPerm([1 .. 3]));
437
+ fail
438
+ gap> S := FullTransformationMonoid(2);;
439
+ gap> List(AsListCanonical(S), x -> Position(S, x)) = [1 .. Size(S)];
440
+ true
441
+ gap> Position(S, AsTransformation((1, 2, 3)));
442
+ fail
443
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
444
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
445
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
446
+ gap> Enumerate(S, 8194);
447
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
448
+ gap> en := Enumerator(S);
449
+ <enumerator of <commutative semigroup of 3x3 max-plus matrices with 1
450
+ generator>>
451
+ gap> en[100];
452
+ Matrix(IsMaxPlusMatrix, [[388, 394, 386], [394, 400, 392], [390, 396, 388]])
453
+ gap> PositionCanonical(S, en[100]);
454
+ 100
455
+
456
+ # PostitionSorted
457
+ gap> S := FullBooleanMatMonoid(2);
458
+ <monoid of 2x2 boolean matrices with 3 generators>
459
+ gap> List(AsListCanonical(S), x -> PositionSorted(S, x));
460
+ [ 10, 7, 12, 9, 15, 3, 8, 11, 5, 14, 2, 16, 6, 13, 1, 4 ]
461
+ gap> PositionSorted(S, Matrix(IsBooleanMat, [[0, 0, 0], [1, 0, 0], [1, 1, 1]]));
462
+ fail
463
+ gap> S := SymmetricInverseMonoid(2);;
464
+ gap> list := AsListCanonical(S);
465
+ [ <identity partial perm on [ 1, 2 ]>, (1,2), <identity partial perm on [ 1 ]>
466
+ , [2,1], [1,2], <identity partial perm on [ 2 ]>, <empty partial perm> ]
467
+ gap> copy := ShallowCopy(list);;
468
+ gap> Sort(copy, {x, y} -> PositionSorted(S, x) < PositionSorted(S, y));
469
+ gap> SortedList(list) = copy;
470
+ true
471
+ gap> PositionSorted(S, PartialPerm([1 .. 3]));
472
+ fail
473
+ gap> S := FullTransformationMonoid(2);;
474
+ gap> list := AsListCanonical(S);
475
+ [ IdentityTransformation, Transformation( [ 2, 1 ] ),
476
+ Transformation( [ 1, 1 ] ), Transformation( [ 2, 2 ] ) ]
477
+ gap> copy := ShallowCopy(list);;
478
+ gap> Sort(copy, {x, y} -> PositionSorted(S, x) < PositionSorted(S, y));
479
+ gap> SortedList(list) = copy;
480
+ true
481
+ gap> PositionSorted(S, AsTransformation((1, 2, 3)));
482
+ fail
483
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
484
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
485
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
486
+ gap> PositionSorted(S, S.1);
487
+ Error, the 1st argument (a semigroup) is not finite
488
+
489
+ # \in
490
+ gap> S := FullBooleanMatMonoid(2);
491
+ <monoid of 2x2 boolean matrices with 3 generators>
492
+ gap> ForAll(S, x -> x in S);
493
+ true
494
+
495
+ # NrIdempotents, Idempotents
496
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
497
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
498
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
499
+ gap> NrIdempotents(S);
500
+ Error, the argument (a semigroup) is not finite
501
+ gap> Idempotents(S);
502
+ Error, the argument (a semigroup) is not finite
503
+ gap> S := FullBooleanMatMonoid(2);
504
+ <monoid of 2x2 boolean matrices with 3 generators>
505
+ gap> NrIdempotents(S);
506
+ 11
507
+ gap> ForAll(Idempotents(S), x -> x ^ 2 = x);
508
+ true
509
+ gap> Length(Idempotents(S));
510
+ 11
511
+ gap> Number(S, x -> x ^ 2 = x);
512
+ 11
513
+
514
+ # MinimalFactorization
515
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
516
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
517
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
518
+ gap> MinimalFactorization(S,
519
+ > Matrix(IsMaxPlusMatrix, [[388, 394, 386],
520
+ > [394, 400, 392],
521
+ > [390, 396, 388]]));
522
+ [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
523
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
524
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
525
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ]
526
+ gap> S := RegularBooleanMatMonoid(2);
527
+ <monoid of 2x2 boolean matrices with 3 generators>
528
+ gap> MinimalFactorization(S, Matrix(IsBooleanMat, [[0, 0, 0], [1, 0, 0], [1, 1, 1]]));
529
+ Error, the 2nd argument (a mult. elt.) must belong to the 1st argument (a semi\
530
+ group)
531
+ gap> MinimalFactorization(S, 7);
532
+ [ 3, 2 ]
533
+
534
+ # LeftCayleyGraphSemigroup/Digraph
535
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
536
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
537
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
538
+ gap> LeftCayleyGraphSemigroup(S);
539
+ Error, the argument (a semigroup) is not finite
540
+ gap> LeftCayleyDigraph(S);
541
+ Error, the argument (a semigroup) is not finite
542
+ gap> RightCayleyGraphSemigroup(S);
543
+ Error, the argument (a semigroup) is not finite
544
+ gap> RightCayleyDigraph(S);
545
+ Error, the argument (a semigroup) is not finite
546
+ gap> S := RegularBooleanMatMonoid(2);
547
+ <monoid of 2x2 boolean matrices with 3 generators>
548
+ gap> LeftCayleyDigraph(S);
549
+ <immutable multidigraph with 16 vertices, 64 edges>
550
+ gap> RightCayleyDigraph(S);
551
+ <immutable multidigraph with 16 vertices, 64 edges>
552
+
553
+ # EnumeratorSorted
554
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
555
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
556
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
557
+ gap> EnumeratorSorted(S);
558
+ Error, the argument (a semigroup) is not finite
559
+ gap> S := FullBooleanMatMonoid(2);
560
+ <monoid of 2x2 boolean matrices with 3 generators>
561
+ gap> N := EnumeratorSorted(S);
562
+ <enumerator of <monoid of size 16, 2x2 boolean matrices with 3 generators>>
563
+ gap> ForAll(N, x -> N[Position(N, x)] = x);
564
+ true
565
+ gap> ForAll([1 .. Length(N)], x -> Position(N, N[x]) = x);
566
+ true
567
+ gap> ForAll(N, x -> x in N);
568
+ true
569
+ gap> ForAll([1 .. Length(N)], x -> IsBound(N[x]));
570
+ true
571
+ gap> IsBound(N[Length(N) + 1]);
572
+ false
573
+ gap> S := SymmetricInverseMonoid(2);
574
+ <symmetric inverse monoid of degree 2>
575
+ gap> N := EnumeratorSorted(S);
576
+ [ <empty partial perm>, <identity partial perm on [ 1 ]>, [1,2], [2,1],
577
+ <identity partial perm on [ 2 ]>, <identity partial perm on [ 1, 2 ]>,
578
+ (1,2) ]
579
+ gap> ForAll(N, x -> N[Position(N, x)] = x);
580
+ true
581
+ gap> ForAll([1 .. Length(N)], x -> Position(N, N[x]) = x);
582
+ true
583
+
584
+ # EnumeratorCanonical
585
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
586
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
587
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
588
+ gap> N := EnumeratorCanonical(S);
589
+ <enumerator of <commutative semigroup of 3x3 max-plus matrices with 1
590
+ generator>>
591
+ gap> ForAll([1 .. 1000], x -> Position(N, N[x]) = x);
592
+ true
593
+ gap> ForAll([1 .. 1000], x -> N[x] in N);
594
+ true
595
+ gap> ForAll([1 .. 1000], x -> IsBound(N[x]));
596
+ true
597
+ gap> N{[1001 .. 1003]};
598
+ [ Matrix(IsMaxPlusMatrix, [[3992, 3998, 3990], [3998, 4004, 3996],
599
+ [3994, 4000, 3992]]),
600
+ Matrix(IsMaxPlusMatrix, [[3996, 4002, 3994], [4002, 4008, 4000],
601
+ [3998, 4004, 3996]]),
602
+ Matrix(IsMaxPlusMatrix, [[4000, 4006, 3998], [4006, 4012, 4004],
603
+ [4002, 4008, 4000]]) ]
604
+ gap> S := FullBooleanMatMonoid(2);
605
+ <monoid of 2x2 boolean matrices with 3 generators>
606
+ gap> N := EnumeratorCanonical(S);
607
+ <enumerator of <monoid of 2x2 boolean matrices with 3 generators>>
608
+ gap> ForAll(N, x -> N[Position(N, x)] = x);
609
+ true
610
+ gap> ForAll([1 .. Length(N)], x -> Position(N, N[x]) = x);
611
+ true
612
+ gap> ForAll(N, x -> x in N);
613
+ true
614
+ gap> ForAll([1 .. Length(N)], x -> IsBound(N[x]));
615
+ true
616
+ gap> IsBound(N[Length(N) + 1]);
617
+ false
618
+ gap> N[Length(N) + 1];
619
+ fail
620
+ gap> S := SymmetricInverseMonoid(2);
621
+ <symmetric inverse monoid of degree 2>
622
+ gap> N := EnumeratorCanonical(S);
623
+ <enumerator of <symmetric inverse monoid of degree 2>>
624
+ gap> ForAll(N, x -> N[Position(N, x)] = x);
625
+ true
626
+ gap> ForAll([1 .. Length(N)], x -> Position(N, N[x]) = x);
627
+ true
628
+ gap> S := FullBooleanMatMonoid(2);
629
+ <monoid of 2x2 boolean matrices with 3 generators>
630
+ gap> AsListCanonical(S);;
631
+ gap> N := EnumeratorCanonical(S);;
632
+ gap> ForAll(N, x -> N[Position(N, x)] = x);
633
+ true
634
+ gap> ForAll([1 .. Length(N)], x -> Position(N, N[x]) = x);
635
+ true
636
+ gap> ForAll(N, x -> x in N);
637
+ true
638
+ gap> ForAll([1 .. Length(N)], x -> IsBound(N[x]));
639
+ true
640
+ gap> IsBound(N[Length(N) + 1]);
641
+ false
642
+ gap> N[Length(N) + 1];
643
+ Error, List Element: <list>[17] must have an assigned value
644
+ gap> S := FreeBand(2);
645
+ <free band on the generators [ x1, x2 ]>
646
+ gap> Enumerator(S){[3 .. 5]};
647
+ [ x1x2, x2x1, x1x2x1 ]
648
+ gap> F := FreeSemigroup(2);; AssignGeneratorVariables(F);;
649
+ gap> rels := [[s1 ^ 2, s1], [s1 * s2, s2], [s2 ^ 2, s2 * s1]];;
650
+ gap> S := F / rels;
651
+ <fp semigroup with 2 generators and 3 relations of length 12>
652
+ gap> EnumeratorCanonical(S)[4];
653
+ fail
654
+ gap>
655
+
656
+ # IteratorSorted
657
+ gap> S := SymmetricInverseMonoid(2);
658
+ <symmetric inverse monoid of degree 2>
659
+ gap> it := IteratorSorted(S);
660
+ <iterator>
661
+ gap> nr := 0;
662
+ 0
663
+ gap> for x in it do nr := nr + 1; od;
664
+ gap> nr = Size(S);
665
+ true
666
+
667
+ # MultiplicationTable
668
+ gap> S := FullBooleanMatMonoid(1);
669
+ <commutative monoid of 1x1 boolean matrices with 1 generator>
670
+ gap> MultiplicationTable(S);
671
+ [ [ 1, 1 ], [ 1, 2 ] ]
672
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
673
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
674
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
675
+ gap> MultiplicationTable(S);
676
+ Error, the argument (a semigroup) is not finite
677
+
678
+ # ClosureSemigroupOrMonoidNC
679
+ gap> S := Semigroup(Matrix(IsBooleanMat, [[0, 0, 0], [1, 0, 0], [1, 1, 1]]));
680
+ <commutative semigroup of 3x3 boolean matrices with 1 generator>
681
+ gap> coll := [Matrix(IsBooleanMat, [[1, 1, 1], [1, 1, 0], [1, 0, 1]]),
682
+ > Matrix(IsBooleanMat, [[1, 1, 0], [1, 0, 1], [1, 1, 0]]),
683
+ > Matrix(IsBooleanMat, [[1, 1, 1], [1, 1, 0], [0, 1, 0]]),
684
+ > Matrix(IsBooleanMat, [[0, 1, 1], [1, 1, 1], [0, 0, 0]]),
685
+ > Matrix(IsBooleanMat, [[0, 0, 1], [0, 1, 0], [0, 0, 0]]),
686
+ > Matrix(IsBooleanMat, [[1, 1, 0], [1, 1, 1], [1, 0, 1]]),
687
+ > Matrix(IsBooleanMat, [[0, 1, 1], [0, 1, 0], [1, 1, 1]]),
688
+ > Matrix(IsBooleanMat, [[1, 1, 0], [1, 1, 1], [0, 0, 1]]),
689
+ > Matrix(IsBooleanMat, [[0, 1, 0], [0, 0, 1], [1, 0, 1]])];;
690
+ gap> S := ClosureSemigroupOrMonoidNC(Semigroup, S, coll, rec());
691
+ <semigroup of 3x3 boolean matrices with 8 generators>
692
+ gap> S := ClosureSemigroupOrMonoidNC(Semigroup, S, coll, rec());
693
+ <semigroup of 3x3 boolean matrices with 8 generators>
694
+
695
+ # ClosureSemigroupOrMonoidNC
696
+ gap> opts := rec(acting := false);
697
+ rec( acting := false )
698
+ gap> S := Semigroup(Transformation([2, 1, 1]),
699
+ > Transformation([3, 1, 1]),
700
+ > Transformation([3, 3, 1]), opts);
701
+ <transformation semigroup of degree 3 with 3 generators>
702
+ gap> S := ClosureSemigroupOrMonoidNC(Semigroup, S,
703
+ > AsList(FullTransformationMonoid(3)), opts);
704
+ <transformation monoid of degree 3 with 5 generators>
705
+ gap> S := ClosureSemigroupOrMonoidNC(Semigroup, S,
706
+ > AsList(FullTransformationMonoid(3)), opts);
707
+ <transformation monoid of degree 3 with 5 generators>
708
+ gap> S := ClosureSemigroupOrMonoidNC(Semigroup, S,
709
+ > [Transformation([1, 2, 1, 3])], opts);
710
+ <transformation monoid of degree 4 with 6 generators>
711
+ gap> S := Semigroup(PartialPerm([1, 2, 4], [1, 2, 3]),
712
+ > PartialPerm([1, 3, 4], [3, 1, 2]),
713
+ > PartialPerm([1, 2], [1, 4]),
714
+ > PartialPerm([1, 3, 4], [4, 2, 1]), opts);
715
+ <partial perm semigroup of rank 4 with 4 generators>
716
+ gap> S := ClosureSemigroupOrMonoidNC(Semigroup, S,
717
+ > [PartialPerm([1, 2, 3, 4], [1, 3, 2, 4])], opts);
718
+ <partial perm semigroup of rank 4 with 5 generators>
719
+
720
+ # RulesOfSemigroup
721
+ gap> S := FullBooleanMatMonoid(2);
722
+ <monoid of 2x2 boolean matrices with 3 generators>
723
+ gap> RulesOfSemigroup(S);
724
+ [ [ [ 1, 1 ], [ 1 ] ], [ [ 1, 2 ], [ 2 ] ], [ [ 1, 3 ], [ 3 ] ],
725
+ [ [ 1, 4 ], [ 4 ] ], [ [ 2, 1 ], [ 2 ] ], [ [ 2, 2 ], [ 1 ] ],
726
+ [ [ 3, 1 ], [ 3 ] ], [ [ 3, 3 ], [ 3 ] ], [ [ 4, 1 ], [ 4 ] ],
727
+ [ [ 4, 3 ], [ 4 ] ], [ [ 4, 4 ], [ 4 ] ], [ [ 2, 3, 4 ], [ 3, 4 ] ],
728
+ [ [ 3, 2, 4 ], [ 2, 4 ] ], [ [ 2, 3, 2, 3 ], [ 3, 2, 3 ] ],
729
+ [ [ 2, 4, 2, 4 ], [ 4, 2, 4 ] ], [ [ 3, 2, 3, 2 ], [ 3, 2, 3 ] ],
730
+ [ [ 3, 4, 2, 3 ], [ 3, 2, 3 ] ], [ [ 3, 4, 2, 4 ], [ 4, 2, 4 ] ],
731
+ [ [ 4, 2, 3, 2 ], [ 4, 2, 3 ] ], [ [ 4, 2, 4, 2 ], [ 4, 2, 4 ] ] ]
732
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
733
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
734
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
735
+ gap> RulesOfSemigroup(S);
736
+ Error, the argument (a semigroup) is not finite
737
+
738
+ # IdempotentsSubset
739
+ gap> S := FullBooleanMatMonoid(2);
740
+ <monoid of 2x2 boolean matrices with 3 generators>
741
+ gap> IdempotentsSubset(S, [2 .. 10]);
742
+ [ 3, 4, 8, 10 ]
743
+ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
744
+ > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
745
+ <commutative semigroup of 3x3 max-plus matrices with 1 generator>
746
+ gap> IdempotentsSubset(S, [666 .. 1000]);
747
+ Error, the 1st argument (a semigroup) is not finite
748
+
749
+ # MultiplicationTable for fp semigroup/monoid
750
+ gap> F := FreeMonoid("a", "b");;
751
+ gap> R := [[F.1 ^ 3, F.1], [F.2 ^ 2, F.2], [F.1 * F.2 * F.1 * F.2, F.1]];;
752
+ gap> S := F / R;;
753
+ gap> MultiplicationTable(S);
754
+ [ [ 1, 2, 3, 4 ], [ 2, 2, 2, 2 ], [ 3, 4, 3, 4 ], [ 4, 4, 4, 4 ] ]
755
+
756
+ # Issue #869, when the size of an fp semigroup/monoid equals its number of
757
+ # generators.
758
+ gap> F := FreeSemigroup(6);
759
+ <free semigroup on the generators [ s1, s2, s3, s4, s5, s6 ]>
760
+ gap> R :=
761
+ > [[F.1 ^ 2, F.1], [F.1 * F.2, F.1], [F.1 * F.3, F.1], [F.1 * F.4, F.1],
762
+ > [F.1 * F.5, F.5], [F.1 * F.6, F.6], [F.2 * F.1, F.1], [F.2 ^ 2, F.1],
763
+ > [F.2 * F.3, F.1], [F.2 * F.4, F.2], [F.2 * F.5, F.5], [F.2 * F.6, F.6],
764
+ > [F.3 * F.1, F.3], [F.3 * F.2, F.3], [F.3 ^ 2, F.3], [F.3 * F.4, F.3],
765
+ > [F.3 * F.5, F.5], [F.3 * F.6, F.6], [F.4 * F.1, F.1], [F.4 * F.2, F.2],
766
+ > [F.4 * F.3, F.3], [F.4 ^ 2, F.4], [F.4 * F.5, F.5], [F.4 * F.6, F.6],
767
+ > [F.5 * F.1, F.5], [F.5 * F.2, F.5], [F.5 * F.3, F.5], [F.5 * F.4, F.5],
768
+ > [F.5 ^ 2, F.5], [F.5 * F.6, F.5], [F.6 * F.1, F.6], [F.6 * F.2, F.6],
769
+ > [F.6 * F.3, F.6], [F.6 * F.4, F.6], [F.6 * F.5, F.6], [F.6 ^ 2, F.6]];;
770
+ gap> S := F / R;
771
+ <fp semigroup with 6 generators and 36 relations of length 114>
772
+ gap> MultiplicationTable(S);
773
+ [ [ 1, 1, 1, 1, 5, 6 ], [ 1, 1, 1, 2, 5, 6 ], [ 3, 3, 3, 3, 5, 6 ],
774
+ [ 1, 2, 3, 4, 5, 6 ], [ 5, 5, 5, 5, 5, 5 ], [ 6, 6, 6, 6, 6, 6 ] ]
775
+
776
+ #
777
+ gap> SEMIGROUPS.StopTest();
778
+ gap> STOP_TEST("Semigroups package: standard/libsemigroups/froidure-pin.tst");