Information for RPM sharedmeataxe-1.0-3.fc33.src.rpm
| ID | 731215 | ||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Name | sharedmeataxe | ||||||||||||||
| Version | 1.0 | ||||||||||||||
| Release | 3.fc33 | ||||||||||||||
| Epoch | |||||||||||||||
| Arch | src | ||||||||||||||
| Summary | Matrix representations over finite fields | ||||||||||||||
| Description | The SharedMeatAxe is a dynamic (shared) library together with a set of programs for working with matrices over finite fields. It is a fork of the C MeatAxe, and differs from it mainly by the implementation of asymptotically fast matrix multiplication and by providing a dynamic (as opposed to static) library and an autotoolized build system. MeatAxe's primary purpose is the calculation of modular character tables, although it can be used for other purposes, such as investigating subgroup structure, module structure etc. Indeed, there is a set of programs to compute automatically the submodule lattice of a given module. The primitive objects are of two types: matrices and permutations. Permutation objects can be handled, but not as smoothly as you might expect. For example, it is hoped that programs such as split (zsp) and multiply (zmu) will be able to work with mixed types, but at present ZSP is restricted to matrices only, and ZMU can multiply a matrix by a permutation, but not vice versa. | ||||||||||||||
| Build Time | 2020-11-27 14:27:24 GMT | ||||||||||||||
| Size | 1022.58 KB | ||||||||||||||
| 751a3e8e69433faa09f1bc505d193f8d | |||||||||||||||
| License | GPLv2+ | ||||||||||||||
| Buildroot | f33-build-344075-59088 | ||||||||||||||
| Provides |
|
||||||||||||||
| Obsoletes | No Obsoletes | ||||||||||||||
| Conflicts | No Conflicts | ||||||||||||||
| Requires |
|
||||||||||||||
| Recommends | No Recommends | ||||||||||||||
| Suggests | No Suggests | ||||||||||||||
| Supplements | No Supplements | ||||||||||||||
| Enhances | No Enhances | ||||||||||||||
| Files |
|
||||||||||||||
| Component of | No Buildroots | ||||||||||||||
