- Experiment. Math.
- Volume 10, Issue 2 (2001), 197-206.
Enumerating Large Orbits and Direct Condensation
We describe a new algorithm for 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 parallelization. For the special case of matrices acting on a finite vector space an efficient implementation is described. This allows us to use condensation methods for considerably larger permutation representations than could be handled before.
Experiment. Math., Volume 10, Issue 2 (2001), 197-206.
First available in Project Euclid: 30 August 2001
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Lübeck, Frank; Neunhöffer, Max. Enumerating Large Orbits and Direct Condensation. Experiment. Math. 10 (2001), no. 2, 197--206. https://projecteuclid.org/euclid.em/999188632