gap-gdat 4r7p8-1 source package in Ubuntu
Changelog
gap-gdat (4r7p8-1) unstable; urgency=low * New upstream release * Bump Standards-Version to 3.9.6 * debian/rules: - use dh_prep instead of dh_clean -k -- Bill Allombert <email address hidden> Mon, 15 Jun 2015 16:11:27 +0200
Upload details
- Uploaded by:
- Bill Allombert
- Uploaded to:
- Sid
- Original maintainer:
- Bill Allombert
- Architectures:
- all
- Section:
- math
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Xenial | release | universe | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| gap-gdat_4r7p8-1.dsc | 1.9 KiB | f7fe63f2fdd933421af485c24fa8eef114255395c2b7febfa7cc3484fad4ebbe |
| gap-gdat_4r7p8.orig.tar.gz | 28.2 MiB | 1b484908351f41b19f8f34c56a74d5574fd3eb6d1875ec7ef6b379d2e3b40398 |
| gap-gdat_4r7p8-1.diff.gz | 5.2 KiB | 0a10e3bc362699d03a6998377f7527076817f23f91254c36f0706a5f6d402ece |
Available diffs
- diff from 4r7p3-1 to 4r7p8-1 (23.4 KiB)
No changes file available.
Binary packages built by this source
- gap-prim-groups: Database of primitive groups for GAP
GAP is a system for computational discrete algebra with particular
emphasis on computational group theory, but which has already proved
useful also in other areas. In the example text, gap is used to
analyse Rubik's Cube using group theory. A kernel implements a Pascal-like
language.
.
This package contains the database of primitive groups.
- gap-small-groups: Database of small groups for GAP
GAP is a system for computational discrete algebra with particular
emphasis on computational group theory, but which has already proved
useful also in other areas. In the example text, gap is used to
analyse Rubik's Cube using group theory. A kernel implements a Pascal-like
language.
.
The Small Groups Library is a catalogue of groups of `small' order.
This package contains the groups data and identification routines for groups
of order up to 1000 except 512, 768 and groups whose order factorises in at
most 3 primes.
.
Note that data for order 512, 768 and between 1000 and 2000 except 1024
are available separately in the gap-small-groups- extra packages.
- gap-small-groups-extra: Large database of small groups for GAP
GAP is a system for computational discrete algebra with particular
emphasis on computational group theory, but which has already proved
useful also in other areas. In the example text, gap is used to
analyse Rubik's Cube using group theory. A kernel implements a Pascal-like
language.
.
The Small Groups Library is a catalogue of groups of `small' order.
This package contains the groups data and identification routines for groups
.
* of order at most 2000 except 1024.
* of cubefree order at most 50 000.
* of order p^n for n <= 6 and all primes p.
* of squarefree order.
* whose order factorises in at most 3 primes.
* of order q^n * p for q^n dividing 2^8, 3^6, 5^5, 7^4 and p prime
different to q
.
The Small Groups Library provides access to these groups and a method to
identify the catalogue number of a given group.
- gap-trans-groups: Database of transitive groups for GAP
GAP is a system for computational discrete algebra with particular
emphasis on computational group theory, but which has already proved
useful also in other areas. In the example text, gap is used to
analyse Rubik's Cube using group theory. A kernel implements a Pascal-like
language.
.
This package contains the database of transitive groups.
