Open Access
Translator Disclaimer
2001 Enumerating Large Orbits and Direct Condensation
Frank Lübeck, Max Neunhöffer
Experiment. Math. 10(2): 197-206 (2001).


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.


Download Citation

Frank Lübeck. Max Neunhöffer. "Enumerating Large Orbits and Direct Condensation." Experiment. Math. 10 (2) 197 - 206, 2001.


Published: 2001
First available in Project Euclid: 30 August 2001

zbMATH: 1044.20006
MathSciNet: MR1837671

Rights: Copyright © 2001 A K Peters, Ltd.


Vol.10 • No. 2 • 2001
Back to Top