1#############################################################################
2##
3##  PackageInfo.g                  LPRES                         René Hartung
4##
5##  Based on Frank Luebeck's template for PackageInfo.g.
6##
7
8SetPackageInfo( rec(
9
10PackageName := "lpres",
11Subtitle := "Nilpotent Quotients of L-Presented Groups",
12Version := "1.0.1",
13Date    := "14/11/2018",
14
15Persons := [
16  rec(
17  LastName      := "Hartung",
18  FirstNames    := "René",
19  IsAuthor      := true,
20  IsMaintainer  := false,
21  ),
22  rec(
23  LastName      := "Bartholdi",
24  FirstNames    := "Laurent",
25  IsAuthor      := false,
26  IsMaintainer  := true,
27  Email         := "laurent.bartholdi@gmail.com",
28  WWWHome       := "http://www.uni-math.gwdg.de/laurent",
29  PostalAddress := Concatenation( [
30                       "Mathematisches Institut\n",
31                       "Bunsenstraße 3-5\n",
32                       "D-37073 Göttingen\n",
33                       "Germany" ] ),
34  Place         := "Göttingen",
35  Institution   := "Georg-August Universität zu Göttingen"
36  )
37],
38
39Status         := "accepted",
40CommunicatedBy := "Alexander Konovalov (St Andrews)",
41AcceptDate     := "09/2018",
42
43SourceRepository := rec(
44    Type := "git",
45    URL := Concatenation( "https://github.com/gap-packages/", ~.PackageName ),
46),
47IssueTrackerURL := Concatenation( ~.SourceRepository.URL, "/issues" ),
48PackageWWWHome  := Concatenation( "https://gap-packages.github.io/", ~.PackageName ),
49README_URL      := Concatenation( ~.PackageWWWHome, "/README.md" ),
50PackageInfoURL  := Concatenation( ~.PackageWWWHome, "/PackageInfo.g" ),
51ArchiveURL      := Concatenation( ~.SourceRepository.URL,
52                                 "/releases/download/v", ~.Version,
53                                 "/", ~.PackageName, "-", ~.Version ),
54
55ArchiveFormats := ".tar.gz",
56
57AbstractHTML   := "The LPRES Package defines new GAP objects to work with \
58L-presented groups, namely groups given by a finite generating set and a \
59possibly-infinite set of relations given as iterates of finitely many \
60seed relations by a finite set of endomorphisms. The package implements \
61nilpotent quotient, Todd-Coxeter and Reidemeister-Schreier algorithms \
62for L-presented groups.",
63
64PackageDoc := rec(
65  BookName  := ~.PackageName,
66  ArchiveURLSubset := ["doc"],
67  HTMLStart := "doc/chap0.html",
68  PDFFile   := "doc/manual.pdf",
69  SixFile   := "doc/manual.six",
70  LongTitle := ~.Subtitle,
71),
72
73AvailabilityTest := ReturnTrue,
74
75BannerString := Concatenation("Loading ", ~.PackageName, " ", String( ~.Version ), " ...\n"),
76
77Dependencies := rec(
78  GAP                    := ">= 4.9",
79  NeededOtherPackages    := [ ["polycyclic", ">= 2.5"],
80                              ["FGA", ">= 1.1.0.1"] ],
81  SuggestedOtherPackages := [ ["ParGAP", ">= 1.1.2" ],
82                              ["AutPGrp", ">= 1.4"],
83                              ["ACE", ">= 5.0" ] ],
84  ExternalConditions     := [ ]
85),
86
87Autoload := false,
88
89TestFile := "tst/testall.g",
90
91Keywords := [ "nilpotent quotient algorithm",
92              "nilpotent presentations",
93              "finitely generated groups",
94              "Grigorchuk group",
95              "Gupta-Sidki group",
96              "L-presented groups",
97              "finite index subgroup of L-presented groups",
98              "coset enumeration",
99              "recursively presented groups",
100              "infinite presentations",
101              "commutators",
102              "lower central series",
103              "Free Engel groups", "Free Burnside groups",
104              "computational", "parallel computing" ]
105));
106