{"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":"15f6bc805a0b5e91ca6e66b83d52c13fb8487425","committime":"2025-08-29T02:19:00","packageid":77015,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky <mjo@gentoo.org>","commitid":"f28646d1e48ce1d1cdef6b3c611771671c23c1eb","committime":"2025-08-29T01:57:40","packageid":77015,"repoid":1,"summary":"dev-gap\/polycyclic: add 2.17"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"df1ad0eb43d167ec17ad510d0c0da6d1f97e0e92","committime":"2024-08-29T14:18:46","packageid":77015,"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":77015,"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":77015,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"juippis@gentoo.org","authorname":"Joonas Niilola","body":"Signed-off-by: Joonas Niilola <juippis@gentoo.org>","commitid":"7ef84dbb7ee5ae3c77802180e2951afc9b4073b3","committime":"2024-05-08T07:32:39","packageid":77015,"repoid":1,"summary":"dev-gap\/polycyclic: Stabilize 2.16 amd64, #931511"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ae3ef41d23a3038b85be95798f13c0ad133b77bb","committime":"2024-03-19T21:04:05","packageid":77015,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Upstream has already recommended that we disable the test suite for this\npackage, so we may be on our own here, but this one is again easy to\npatch out and the rest of the test suite passes.\n\nSigned-off-by: Michael Orlitzky <mjo@gentoo.org>","commitid":"4217dbbe01a264196b0b693e4de1ffb306b80d6c","committime":"2024-03-19T20:43:39","packageid":77015,"repoid":1,"summary":"dev-gap\/polycyclic: patch out a failing test"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ef7e430d211f596ad971e729444e8a50fe17a0d1","committime":"2024-01-22T11:35:12","packageid":77015,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"This was a circular dependency that was commented out for a moment.\n\nSigned-off-by: Michael Orlitzky <mjo@gentoo.org>","commitid":"e625c4e3eef29c481e1ef132f3af1e8d2aaf6dff","committime":"2023-12-21T15:18:28","packageid":77015,"repoid":1,"summary":"dev-gap\/polycyclic: add PDEPEND=dev-gap\/alnuth and enable tests"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky <mjo@gentoo.org>","commitid":"067b1db0f51d2dac7b5b48c89f4e17fa529d6644","committime":"2023-12-21T15:15:09","packageid":77015,"repoid":1,"summary":"dev-gap\/polycyclic: new package, add 2.16"}],"dependencies":[],"depending":[{"block":false,"categoryid":1562,"description":"Almost-crystallographic group library and algorithms for GAP","ebuildids":[874411],"firstseen":"2024-01-22T11:43:13.819329","name":"aclib","packageid":76973,"summary":"The AClib package contains a library of almost crystallographic groups and a some algorithms to compute with these groups. A group is called almost crystallographic if it is finitely generated nilpotent-by-finite and has no non-trivial finite normal subgroups."},{"block":false,"categoryid":1562,"description":"Algebraic number theory and an interface to PARI\/GP","ebuildids":[812641],"firstseen":"2024-01-22T11:43:13.819329","name":"alnuth","packageid":76974,"summary":"The Alnuth package provides various methods to compute with number fields which are given by a defining polynomial or by generators. Some of the methods provided in this package are written in GAP code. The other part of the methods is imported from the computer algebra system PARI\/GP."},{"block":false,"categoryid":1562,"description":"GAP package for computing with crystallographic groups","ebuildids":[874415],"firstseen":"2024-01-22T11:43:13.819329","name":"cryst","packageid":76985,"summary":"This package, previously known as CrystGAP, provides a rich set of methods for the computation with affine crystallographic groups, in particular space groups. Affine crystallographic groups are fully supported both in representations acting from the right or from the left, the latter one being preferred by crystallographers. Functions to determine representatives of all space group types of a given dimension are also provided."},{"block":false,"categoryid":1562,"description":"Homological Algebra Programming (HAP) in GAP","ebuildids":[874419],"firstseen":"2024-01-22T11:43:13.819329","name":"hap","packageid":77000,"summary":"HAP is a package for some calculations in elementary algebraic topology and the cohomology of groups. The initial focus of the library was on computations related to the cohomology of finite and infinite groups, with particular emphasis on integral coefficients. The focus has since broadened to include Steenrod algebras of finite groups, Bredon homology, cohomology of simplicial groups, and general computations in algebraic topology relating to finite CW-complexes, covering spaces, knots, knotted surfaces, and topics such as persitent homology arising in topological data analysis."},{"block":false,"categoryid":1562,"description":"A HAP extension for crytallographic groups","ebuildids":[812668],"firstseen":"2024-01-22T11:43:13.819329","name":"hapcryst","packageid":77001,"summary":"This is an extension to the HAP package by Graham Ellis. It implements geometric methods for the calculation of resolutions of Bieberbach groups."},{"block":false,"categoryid":1562,"description":"Nilpotent Quotients of finitely-presented groups","ebuildids":[845613],"firstseen":"2024-01-22T11:43:13.819329","name":"nq","packageid":77012,"summary":"This package provides access to the ANU nilpotent quotient program for computing nilpotent factor groups of finitely presented groups."},{"block":false,"categoryid":1562,"description":"Polycyclic presentations for matrix groups","ebuildids":[812681,874422],"firstseen":"2024-01-22T11:43:13.819329","name":"polenta","packageid":77014,"summary":"The Polenta package provides methods to compute polycyclic presentations of matrix groups (finite or infinite). As a by-product, this package gives some functionality to compute certain module series for modules of solvable groups. For example, if G is a rational polycyclic matrix group, then we can compute the radical series of the natural Q[G]-module Q^d."},{"block":false,"categoryid":1562,"description":"Set-theoretic computations with residue classes in GAP","ebuildids":[812688],"firstseen":"2024-01-22T11:43:13.819329","name":"resclasses","packageid":77021,"summary":"This package permits to compute with set-theoretic unions of residue classes of Z and a few other rings. In particular it provides methods for computing unions, intersections and differences of these sets."},{"block":false,"categoryid":1562,"description":"Utility functions in GAP","ebuildids":[845620,874427],"firstseen":"2024-01-22T11:43:13.819329","name":"utils","packageid":77032,"summary":"This package collects together utility functions from a selection of GAP packages in order to make them more widely visible to other package authors. Other generally useful functions, which are not deemed suitable for the main library, and also welcome. For example, recent additions are functions to convert certain types of group to Magma format."}],"ebuilds":[{"archs":["~amd64","~riscv"],"ebuildid":874195,"firstseen":"2025-08-29T03:20:55.944150","license":"GPL-2+","moddate":"2025-08-29T02:20:55","packageid":77015,"repoid":1,"slot":"0","uses":["test"],"version":"2.17"},{"archs":["amd64","~riscv"],"ebuildid":812682,"firstseen":"2024-01-22T11:43:13.819329","license":"GPL-2+","moddate":"2024-11-23T14:44:47","packageid":77015,"repoid":1,"slot":"0","uses":["test"],"version":"2.16"}],"masks":[],"package":{"categoryid":1562,"description":"Computation with polycyclic groups","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"},"rdependencies":[{"block":false,"categoryid":1562,"description":"Computing the Automorphism Group of a p-Group","ebuildids":[812682,874195],"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."},{"block":false,"categoryid":1562,"description":"GAP documentation structure and tooling","ebuildids":[812682,874195],"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":[812682,874195],"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":[812682,874195],"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":[812682,874195],"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":[812682,874195],"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\/#polycyclic"],"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"}]}