Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 9 additions & 10 deletions packages/grpconst/meta.json
Original file line number Diff line number Diff line change
@@ -1,11 +1,11 @@
{
"AbstractHTML": "The <span class=\"pkgname\">GrpConst</span> package contains methods to construct up to isomorphism the groups of a given order. The FrattiniExtensionMethod constructs all soluble groups of a given order. On request it gives only those that are (or are not) nilpotent or supersolvable or that do (or do not) have normal Sylow subgroups for some given set of primes. The CyclicSplitExtensionMethod constructs all groups having a normal Sylow subgroup for orders of the type p^n *q. The method relies on the availability of a list of all groups of order p^n. The UpwardsExtensions algorithm takes as input a permutation group G and a positive integer s and returns a list of permutation groups, one for each extension of G by a soluble group of order a divisor of s. This method can used to construct the non-solvable groups of a given order by taking the perfect groups of certain orders as input for G. The programs in this package have been used to construct a large part of the Small Groups library.",
"AbstractHTML": "The <span class=\"pkgname\">GrpConst</span> package contains methods to construct up to isomorphism the groups of a given order. The FrattiniExtensionMethod constructs all soluble groups of a given order. On request it gives only those that are (or are not) nilpotent or supersoluble or that do (or do not) have normal Sylow subgroups for some given set of primes. The CyclicSplitExtensionMethod constructs all groups having a normal Sylow subgroup for orders of the type p^n * q. The method relies on the availability of a list of all groups of order p^n. The UpwardsExtensions algorithm takes as input a permutation group G and a positive integer s and returns a list of permutation groups, one for each extension of G by a soluble group of order a divisor of s. This method can be used to construct the non-soluble groups of a given order by taking the perfect groups of certain orders as input for G. The programs in this package have been used to construct a large part of the Small Groups library.",
"ArchiveFormats": ".tar.gz",
"ArchiveSHA256": "49d7b312cafd941189c3ce2e1513a13eed971d6dfff1fe074d19c1bab0c6dc3f",
"ArchiveSize": 210465,
"ArchiveURL": "https://github.com/gap-packages/grpconst/releases/download/v2.6.6/grpconst-2.6.6",
"ArchiveSHA256": "a103d5774d59ebdadb48aa479ca223819b3c76664437a830981f1066dd17fd27",
"ArchiveSize": 242080,
"ArchiveURL": "https://github.com/gap-packages/grpconst/releases/download/v2.7.0/grpconst-2.7.0",
"AvailabilityTest": null,
"Date": "2026-07-21",
"Date": "2026-08-14",
"Dependencies": {
"ExternalConditions": [],
"GAP": ">=4.11",
Expand Down Expand Up @@ -36,17 +36,16 @@
"PackageDoc": [
{
"ArchiveURLSubset": [
"doc",
"htm"
"doc"
],
"BookName": "GrpConst",
"HTMLStart": "htm/chapters.htm",
"HTMLStart": "doc/chap0_mj.html",
"LongTitle": "Constructing the Groups of a Given Order",
"PDFFile": "doc/manual.pdf",
"SixFile": "doc/manual.six"
}
],
"PackageInfoSHA256": "fb43c613999bce7d71e75f58c7c84c77788a788dd5115e71e716456a30ef27b5",
"PackageInfoSHA256": "3374b4dfb50f837b9c8e00745c9f0ea4d3c3ac6e3fd59d3506212e2a535425cf",
"PackageInfoURL": "https://gap-packages.github.io/grpconst/PackageInfo.g",
"PackageName": "GrpConst",
"PackageWWWHome": "https://gap-packages.github.io/grpconst/",
Expand Down Expand Up @@ -89,5 +88,5 @@
},
"Subtitle": "Constructing the Groups of a Given Order",
"TestFile": "tst/testall.g",
"Version": "2.6.6"
"Version": "2.7.0"
}
Loading