Result 1 to 6 from 6 total
Scalable parallel coset enumeration: bulk definition and the memory wall. (English)
J. Symb. Comput. 33, No.5, 563-585 (2002).
1
A new existence proof for $Ly$, the sporadic simple group of R. Lyons. (English)
J. Symb. Comput. 31, No.1-2, 203-209 (2001).
2
An algorithm for the construction of defining set of relations for a finite group. (English)
Vorlesungen aus dem Fachbereich Mathematik der Universität Essen 27. Essen: Univ. Essen, Department of Mathematics and Computer Science. iv, 102~p. (1999).
3
Finding possible permutation characters. (English)
J. Symb. Comput. 26, No.3, 343-354 (1998).
4
The Lyons group has no distance-transitive representation. (English)
De Clerck, Frank (ed.) et al., Finite geometry and combinatorics. The 2nd international conference at Astene-Deinze, Belgium, 31 May - 6 June 1992. Proceedings. Cambridge: University Press. Lond. Math. Soc. Lect. Note Ser. 191, 355-358 (1993).
5
The computer construction of matrix representations of finite groups over finite fields. (English)
J. Symb. Comput. 9, No.5-6, 583-590 (1990).
6
Result 1 to 6 from 6 total
Start
Contact
Print
General Help
