Analysing finitely presented groups by constructing representations

Journal of Symbolic Computation

Volumn 24, Issue 3-4, 1997, Pages 335-349

  Plesken, W ^a   Souvignier, B ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031236522     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0131     Document Type: Article

References (25)

1. Alperin, J.L. (1986). Local Representation Theory. Cambridge: Cambridge University Press.
2. Bourbaki, N. (1972). Commutative Algebra. Paris: Hermann.
3. Bruhat, F., Tits, J. (1972). Groupes réductifs sur un corps local. IHES, Publications Mathématics No. 41, 5-252.
4. Buchberger, B. (1965). Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. Doctoral Dissertation Math. Inst. University of Innsbruck, Austria.
5. Curtis, C.W., Reiner, I. (1990). Methods of Representation Theory, Volume I. New York: Wiley.
6. Gantmacher, F.R. (1959). Matrizenrechnung II. Berlin: VEB Deutscher Verlag der Wissenschaften.
7. Gaschütz, W., Newman, M.F. (1970). On presentations of finite p-groups. J. für Reine Angew. Math. 245, 172-176.
8. Geddes, K.O., Czapor, S.R., Labahn, G. (1992). Algorithms for Computer Algebra. Boston: Kluwer Academic Publishers.
9. Havas, G., Newman, M.F. (1980). Application of computers to questions like those of Burnside. Lecture Notes in Mathematics 806, 211-230, Berlin: Springer.
10. Holt, D.F., Plesken, W. (1989). Perfect Groups. Oxford: Oxford University Press.
11. Holt, D.F., Plesken, W. (1992). A Cohomological Criterion For A Finitely Presented Group To Be Infinite. J. London Math. Soc. 45(2), 469-480.
12. Holt, D.F., Plesken, W. (1993). The p-Coclass of a Group. J. Algebra 162(2), 335-342.
13. Holt, D.F., Plesken, W., Souvignier, B. (1997). Constructing a representation of the group (2,3, 7; 11). J. Symbolic Comput. 24, 489-492.
14. Holt, D.F., Rees, S. (1993). A graphics system for displaying finite quotients of finitely presented groups. Groups and Computation, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 11, AMS, pp. 113-126.
15. Kneser, M. (1965). Galois-Kohomologie halbeinfacher algebraischer Gruppen über p-adischen Körpern. Math. Z. 88, 40-47, 89, 250-272.
16. Lenstra, A.K., Lenstra, H.W., Lovász, L. (1982). Factoring polynomials with rational coefficients. Math. Annalen 261, 515-534.
17. Plesken, W. (1987). Towards a Soluble Quotient Algorithm. J. Symbolic Comput. 4, 111-122.
18. Pohst, M. et al., (1993). KANT-V2. Computer Algebra in Deutschland, edited by Fachgruppe Computeralgebra der GI, DMV und GAMM, pp. 212-218.
19. Satake, I. (1971). Classification Theory of Semi-Simple Algebraic Groups. Lecture Notes in Pure and Applied Mathematics, New York.
20. Tits, J. (1979). Reductive groups over local fields. AMS Proc. Symposia Pure Mathematics 33(1), 29-69.
21. Tschebotaröw, N. (1926). Die Bestimmung der Dichtigkeit einer Menge von Primzahlen, welche zu einer gegebenen Substitutionsklasse gehören. Math. Annalen 95, 191-228.
22. px). J. Australian Math. Soc. 8, 523-543.
23. de Weger, B. (1989). Algorithms for diophantine equations. CWI TRACT 65, pp. 60-69.
24. Wester, M. (1985). Endliche fahnentransitive Tits-Geometrien und ihre universellen Überlagerungen. Mitteilungen aus dem Math. Seminar Giessen, Heft 170, 62-73.
25. 6. J. Symbolic Comput. 15, 211-227