#### Filter Results:

#### Publication Year

1996

2010

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We describe a new implementation of direct condensation, which is a tool in computational representation theory. The crucial point for this is the enumeration of very large orbits for a group acting on some set. We present a variation of the standard orbit enumeration algorithm that reduces the amount of storage needed and behaves well under… (More)

We describe a " semi-modular " algorithm which computes for a given integer matrix A of known rank and a given prime p the multiplicities of p in the factorizations of the elementary divisors of A. Here " semi-modular " means that we apply operations to the integer matrix A but the operations are driven by considering only reductions of row vectors modulo… (More)

We report on the project of parallelising GAP, a system for computational algebra. Our design aims to make concurrency facilities available for GAP users, while preserving as much of the existing code base (about one million lines of code) with as few changes as possible and without requiring users---a large percentage of whom are domain experts in their… (More)

- ‹
- 1
- ›