{"bugs":[],"categories":[{"categoryid":1562,"name":"dev-gap","summary":"The dev-gap category contains packages for the GAP computer algebra system, available at https:\/\/www.gap-system.org\/packages\/."},{"categoryid":318,"name":"sci-libs","summary":"The sci-libs category contains various science-related libraries."},{"categoryid":317,"name":"sci-mathematics","summary":"The sci-mathematics category contains mathematical software."}],"changelog":[{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"fde5db99f97b0021af03d25b81469a0eac04b762","committime":"2024-11-23T14:24:35","packageid":77022,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky <mjo@gentoo.org>","commitid":"822ae47b54883272c71b32ba587aae1427fe8087","committime":"2024-11-21T01:13:33","packageid":77022,"repoid":1,"summary":"dev-gap\/semigroups: add 5.4.0, drop 5.3.7"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"df1ad0eb43d167ec17ad510d0c0da6d1f97e0e92","committime":"2024-08-29T14:18:46","packageid":77022,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"(And rearrange some variables to appease pkgcheck.)\n\nSigned-off-by: Michael Orlitzky <mjo@gentoo.org>","commitid":"48c64c09523127fdf44095413e11ed5bd2e288fe","committime":"2024-08-28T13:20:20","packageid":77022,"repoid":1,"summary":"sci-mathematics\/gap,dev-gap\/*: add ~riscv keywords"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ae3ef41d23a3038b85be95798f13c0ad133b77bb","committime":"2024-03-19T21:04:05","packageid":77022,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky <mjo@gentoo.org>","commitid":"46513338e821294f5b80d2197ecb023f70bcb0c5","committime":"2024-03-19T13:29:47","packageid":77022,"repoid":1,"summary":"dev-gap\/semigroups: add 5.3.7, drop 5.3.6"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"945aec7b87879ca6fba4b30a9004707078c4620e","committime":"2024-02-25T01:18:50","packageid":77022,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Closes: https:\/\/bugs.gentoo.org\/924165\nSigned-off-by: Michael Orlitzky <mjo@gentoo.org>","commitid":"3be1450526a43d47e3fe54041588def27536002b","committime":"2024-02-25T01:02:41","packageid":77022,"repoid":1,"summary":"dev-gap\/semigroups: add 5.3.6, drop 5.3.2"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ef7e430d211f596ad971e729444e8a50fe17a0d1","committime":"2024-01-22T11:35:12","packageid":77022,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky <mjo@gentoo.org>","commitid":"014b2583e997031800781575a18b40b188db59c3","committime":"2023-12-21T23:02:34","packageid":77022,"repoid":1,"summary":"dev-gap\/semigroups: new package, add 5.3.2"}],"dependencies":[{"block":false,"categoryid":318,"description":"C++ library for semigroups and monoids","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"libsemigroups","packageid":77033,"summary":"libsemigroups is a C++14 library containing implementations of several algorithms for computing finite, and finitely presented, semigroups and monoids. Namely: * the Froidure-Pin algorithm for computing finite semigroups; * the Todd-Coxeter algorithm for finitely presented semigroups and monoids; * the Knuth-Bendix algorithm for finitely presented semigroups and monoids; * the Schreier-Sims algorithm for permutation groups; * a preliminary implementation of the Konieczny and Lallement- McFadden algorithm for computing finite semigroups which act on sets; * an implementation of the Radoszewski-Rytter algorithm for testing equivalence of words in free bands; * an implementation of the algorithm for solving the word problem for small overlap monoids, and for computing normal forms in such monoids; * a version of Sims low index subgroup algorithm for computing one-sided congruences of a semigroup or monoid; * a version of Stephen's procedure for finitely presented semigroups and monoids (for a given word w this procedure is for determining words equivalent to w or that are left divisors of w)."},{"block":false,"categoryid":317,"description":"System for computational discrete algebra. Core functionality.","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"gap","packageid":77034,"summary":"Groups, Algorithms, Programming is a system for computational discrete algebra, with particular emphasis on Computational Group Theory. GAP provides a programming language, a library of thousands of functions implementing algebraic algorithms written in the GAP language as well as large data libraries of algebraic objects. GAP is used in research and teaching for studying groups and their representations, rings, vector spaces, algebras, combinatorial structures, and more."}],"depending":[],"ebuilds":[{"archs":["~amd64","~riscv"],"ebuildid":845616,"firstseen":"2024-11-23T14:44:47.658275","license":"GPL-3+","moddate":"2024-11-23T14:44:47","packageid":77022,"repoid":1,"slot":"0","uses":["test"],"version":"5.4.0"}],"masks":[],"package":{"categoryid":1562,"description":"GAP package for semigroups and monoids","firstseen":"2024-01-22T11:43:13.819329","name":"semigroups","packageid":77022,"summary":"The Semigroups package is a GAP package for semigroups, and monoids. There are particularly efficient methods for finitely presented semigroups and monoids, and for semigroups and monoids consisting of transformations, partial permutations, bipartitions, partitioned binary relations, subsemigroups of regular Rees 0-matrix semigroups, and matrices of various semirings including boolean matrices, matrices over finite fields, and certain tropical matrices. Semigroups contains efficient methods for creating semigroups, monoids, and inverse semigroups and monoids, calculating their Green's structure, ideals, size, elements, group of units, small generating sets, testing membership, finding the inverses of a regular element, factorizing elements over the generators, and so on. It is possible to test if a semigroup satisfies a particular property, such as if it is regular, simple, inverse, completely regular, and a large number of further properties. There are methods for finding presentations for a semigroup, the congruences of a semigroup, the maximal subsemigroups of a finite semigroup, smaller degree partial permutation representations, and the character tables of inverse semigroups. There are functions for producing pictures of the Green's structure of a semigroup, and for drawing graphical representations of certain types of elements."},"rdependencies":[{"block":false,"categoryid":1562,"description":"Collection of standard data structures for GAP","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"datastructures","packageid":76989,"summary":"The datastructures package aims at providing standard datastructures, consolidating existing code and improving on it, in particular in view of HPC-GAP. The datastructures package consists of two parts: interface declarations and implementations. The goal of interface declarations is to define standard interfaces for datastructures and decouple them from the implementations. This enables easy exchangability of implementations, for example for more efficient implementations, or implementations more suited for parallelisation or sequential use. The datastructures package declares interfaces for the following datastructures: * queues * doubly linked lists * heaps * priority queues * hash tables * dictionaries"},{"block":false,"categoryid":1562,"description":"Graphs, digraphs, and multidigraphs in GAP","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"digraphs","packageid":76991},{"block":false,"categoryid":1562,"description":"GAP documentation structure and tooling","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"gapdoc","packageid":76995,"summary":"This package contains a definition of a structure for GAP (package) documentation, based on XML. It also contains conversion programs for producing text-, PDF- or HTML-versions of such documents, with hyperlinks if possible."},{"block":false,"categoryid":1562,"description":"GAP implementation of the randomized Schreier-Sims algorithm","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"genss","packageid":76997,"summary":"The genss package implements the randomised Schreier-Sims algorithm to compute a stabiliser chain and a base and strong generating set for arbitrary finite groups."},{"block":false,"categoryid":1562,"description":"Find minimal and canonical images in permutation groups","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"images","packageid":77003},{"block":false,"categoryid":1562,"description":"Bindings for low level C library I\/O routines","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"io","packageid":77004,"summary":"The IO package, as its name suggests, provides bindings for GAP to the lower levels of Input\/Output functionality in the C library."},{"block":false,"categoryid":1562,"description":"GAP methods to enumerate orbits","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"orb","packageid":77013},{"block":false,"categoryid":1562,"description":"GAP Primitive Permutation Groups Library","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"primgrp","packageid":77017,"summary":"The PrimGrp package provides the library of primitive permutation groups which includes, up to permutation isomorphism (i.e., up to conjugacy in the corresponding symmetric group), all primitive permutation groups of degree less than 4096."},{"block":false,"categoryid":1562,"description":"The GAP Small Groups Library","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"smallgrp","packageid":77025,"summary":"The SmallGrp package provides the library of groups of certain \"small\" orders. The groups are sorted by their orders and they are listed up to isomorphism; that is, for each of the available orders a complete and irredundant list of isomorphism type representatives of groups is given."},{"block":false,"categoryid":1562,"description":"GAP transitive groups library","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"transgrp","packageid":77031,"summary":"A library of transitive groups. Groups of degree 15-30 are due to Alexander Hulpke Degree 32 is due to John Cannon and Derek Holt Degree 34-48 is due to Derek Holt and Gordon Royle. Groups of degree 32 (~30MB) and 48 (~30GB) need to be downloaded separately."},{"block":false,"categoryid":318,"description":"C++ library for semigroups and monoids","ebuildids":[845616],"firstseen":"2024-01-22T11:43:13.819329","name":"libsemigroups","packageid":77033,"summary":"libsemigroups is a C++14 library containing implementations of several algorithms for computing finite, and finitely presented, semigroups and monoids. Namely: * the Froidure-Pin algorithm for computing finite semigroups; * the Todd-Coxeter algorithm for finitely presented semigroups and monoids; * the Knuth-Bendix algorithm for finitely presented semigroups and monoids; * the Schreier-Sims algorithm for permutation groups; * a preliminary implementation of the Konieczny and Lallement- McFadden algorithm for computing finite semigroups which act on sets; * an implementation of the Radoszewski-Rytter algorithm for testing equivalence of words in free bands; * an implementation of the algorithm for solving the word problem for small overlap monoids, and for computing normal forms in such monoids; * a version of Sims low index subgroup algorithm for computing one-sided congruences of a semigroup or monoid; * a version of Stephen's procedure for finitely presented semigroups and monoids (for a given word w this procedure is for determining words equivalent to w or that are left divisors of w)."},{"block":false,"categoryid":317,"description":"System for computational discrete algebra. Core functionality.","ebuildids":[845616,845616],"firstseen":"2024-01-22T11:43:13.819329","name":"gap","packageid":77034,"summary":"Groups, Algorithms, Programming is a system for computational discrete algebra, with particular emphasis on Computational Group Theory. GAP provides a programming language, a library of thousands of functions implementing algebraic algorithms written in the GAP language as well as large data libraries of algebraic objects. GAP is used in research and teaching for studying groups and their representations, rings, vector spaces, algebras, combinatorial structures, and more."}],"repos":[{"branch":"master","lastcommit":"80d925425254fefe2aa63b033753274b410beb57","name":"gentoo","path":"\/usr\/portage","repoid":1,"upstream":"origin"}],"tracked":false,"urls":["https:\/\/www.gap-system.org\/packages\/#semigroups"],"uses":[{"description":"Enable dependencies and\/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently)","isdefault":false,"use":"test"}]}