{"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":317,"name":"sci-mathematics","summary":"The sci-mathematics category contains mathematical software."}],"changelog":[{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"df1ad0eb43d167ec17ad510d0c0da6d1f97e0e92","committime":"2024-08-29T14:18:46","packageid":76977,"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 ","commitid":"48c64c09523127fdf44095413e11ed5bd2e288fe","committime":"2024-08-28T13:20:20","packageid":76977,"repoid":1,"summary":"sci-mathematics\/gap,dev-gap\/*: add ~riscv keywords"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"df93d8996bee9324178fbcae241716fd3b905b21","committime":"2024-05-08T07:48:56","packageid":76977,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"juippis@gentoo.org","authorname":"Joonas Niilola","body":"Signed-off-by: Joonas Niilola ","commitid":"94ab6fec36af7d7a80555d88bb3316dd7fcee806","committime":"2024-05-08T07:32:38","packageid":76977,"repoid":1,"summary":"dev-gap\/autpgrp: Stabilize 1.11 amd64, #931511"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ef7e430d211f596ad971e729444e8a50fe17a0d1","committime":"2024-01-22T11:35:12","packageid":76977,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky ","commitid":"f6a03a1131372d1e96bbcbfa5f7aba3c840f2196","committime":"2023-12-21T15:10:26","packageid":76977,"repoid":1,"summary":"dev-gap\/autpgrp: new package, add 1.11"}],"dependencies":[],"depending":[{"block":false,"categoryid":1562,"description":"Computation with polycyclic groups","ebuildids":[812682,874195],"firstseen":"2024-01-22T11:43:13.819329","name":"polycyclic","packageid":77015,"summary":"This package provides various algorithms for computations with polycyclic groups defined by polycyclic presentations. The features of this package include, * creating a polycyclic group from a polycyclic presentation arithmetic in a polycyclic group * computation with subgroups and factor groups of a polycyclic group * computation of standard subgroup series such as the derived series, the lower central series * computation of the first and second cohomology * computation of group extensions * computation of normalizers and centralizers * solutions to the conjugacy problems for elements and subgroups * computation of torsion and various finite subgroups * computation of various subgroups of finite index * computation of the Schur multiplicator, the non-abelian exterior square and the non-abelian tenor square"},{"block":false,"categoryid":1562,"description":"Computing in nilpotent Lie algebras","ebuildids":[812694],"firstseen":"2024-01-22T11:43:13.819329","name":"sophus","packageid":77027,"summary":"The Sophus package is written to compute with nilpotent Lie algebras over finite prime fields. Using this package, you can compute the cover, the list of immediate descendants, and the automorphism group of such Lie algebras. You can also test if two such Lie algebras are isomorphic. The immediate descendant function of the package can be used to classify small-dimensional nilpotent Lie algebras over a given field. For instance, the package author obtained a classification of nilpotent Lie algebras with dimension at most 9 over F_2."}],"ebuilds":[{"archs":["amd64","~riscv"],"ebuildid":812644,"firstseen":"2024-01-22T11:43:13.819329","license":"GPL-2+","moddate":"2024-11-23T14:44:47","packageid":76977,"repoid":1,"slot":"0","uses":["test"],"version":"1.11"}],"masks":[],"package":{"categoryid":1562,"description":"Computing the Automorphism Group of a p-Group","firstseen":"2024-01-22T11:43:13.819329","name":"autpgrp","packageid":76977,"summary":"The AutPGrp package introduces a new function to compute the automorphism group of a finite p-group. The underlying algorithm is a refinement of the methods described in O'Brien (1995). In particular, this implementation is more efficient in both time and space requirements and hence has a wider range of applications than the ANUPQ method. It also usually out-performs all but the method designed for finite abelian groups."},"rdependencies":[{"block":false,"categoryid":1562,"description":"GAP documentation structure and tooling","ebuildids":[812644],"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 Primitive Permutation Groups Library","ebuildids":[812644],"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":[812644],"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":[812644],"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":317,"description":"System for computational discrete algebra. Core functionality.","ebuildids":[812644],"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":"52197549fd3431fa256b8edbafdcd3702dd0e134","name":"gentoo","path":"\/usr\/portage","repoid":1,"upstream":"origin"}],"tracked":false,"urls":["https:\/\/www.gap-system.org\/packages\/#autpgrp"],"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"}]}