Calculs en théorie des groupes et introduction au langage GAP (Groups, Algorithms and Programming)
Michel, Jean1
1 Équipe des groupes finis, Institut de Mathématiques, UMR CNRS 7586, 175, rue du Chevaleret 75013 Paris
Journées mathématiques X-UPS, Groupes finis (2000), pp. 81-109.
Publié le :
DOI : 10.5802/xups.2000-03
Michel, Jean 1

1 Équipe des groupes finis, Institut de Mathématiques, UMR CNRS 7586, 175, rue du Chevaleret 75013 Paris 
@incollection{XUPS_2000____81_0,
     author = {Michel, Jean},
     title = {Calculs en th\'eorie des groupes et introduction au langage {GAP} {(Groups,~Algorithms} and {Programming)}},
     booktitle = {Groupes finis},
     series = {Journ\'ees math\'ematiques X-UPS},
     pages = {81--109},
     publisher = {Les \'Editions de l{\textquoteright}\'Ecole polytechnique},
     year = {2000},
     doi = {10.5802/xups.2000-03},
     language = {fr},
     url = {http://www.numdam.org/articles/10.5802/xups.2000-03/}
}
TY  - JOUR
AU  - Michel, Jean
TI  - Calculs en théorie des groupes et introduction au langage GAP (Groups, Algorithms and Programming)
JO  - Journées mathématiques X-UPS
PY  - 2000
SP  - 81
EP  - 109
PB  - Les Éditions de l’École polytechnique
UR  - http://www.numdam.org/articles/10.5802/xups.2000-03/
DO  - 10.5802/xups.2000-03
LA  - fr
ID  - XUPS_2000____81_0
ER  - 
%0 Journal Article
%A Michel, Jean
%T Calculs en théorie des groupes et introduction au langage GAP (Groups, Algorithms and Programming)
%J Journées mathématiques X-UPS
%D 2000
%P 81-109
%I Les Éditions de l’École polytechnique
%U http://www.numdam.org/articles/10.5802/xups.2000-03/
%R 10.5802/xups.2000-03
%G fr
%F XUPS_2000____81_0
Michel, Jean. Calculs en théorie des groupes et introduction au langage GAP (Groups, Algorithms and Programming). Journées mathématiques X-UPS, Groupes finis (2000), pp. 81-109. doi : 10.5802/xups.2000-03. http://www.numdam.org/articles/10.5802/xups.2000-03/

[Asc84] Aschbacher, M. On the maximal subgroups of the finite classical groups, Invent. Math., Volume 76 (1984) no. 3, pp. 469-514 | DOI | MR | Zbl

[BBR93] Babai, László; Beals, Robert; Rockmore, Daniel Deciding finiteness of matrix groups in deterministic polynomial time, ISSAC ’93. Proceedings of the 1993 international symposium on Symbolic and algebraic computation (Kiev, Ukraine, July 1993), ACM Press, Baltimore, MD, 1993, pp. 117-126 | DOI | Zbl

[CLG97] Celler, Frank; Leedham-Green, C. R. A non-constructive recognition algorithm for the special linear and other classical groups, Groups and computation, II (New Brunswick, NJ, 1995) (DIMACS Ser. Discrete Math. Theoret. Comput. Sci.), Volume 28, American Mathematical Society, Providence, RI, 1997, pp. 61-67 | DOI | MR | Zbl

[Dix67] Dixon, John D. High speed computation of group characters, Numer. Math., Volume 10 (1967), pp. 446-450 | DOI | MR | Zbl

[Joh97] Johnson, D. L. Presentations of groups, London Math. Society Student Texts, 15, Cambridge University Press, Cambridge, 1997 | DOI | Numdam

[Mih58] Mihaĭlova, K. A. The occurrence problem for direct products of groups, Dokl. Akad. Nauk SSSR, Volume 119 (1958), pp. 1103-1105 | MR

[Nor80] Norton, Simon The construction of J 4 , The Santa Cruz Conference on Finite Groups (Univ. California, Santa Cruz, Calif., 1979) (Proc. Sympos. Pure Math.), Volume 37, American Mathematical Society, Providence, RI, 1980, pp. 271-277 | MR | Zbl

[Sch90] Schneider, Gerhard J. A. Dixon’s character table algorithm revisited, J. Symbolic Comput., Volume 9 (1990) no. 5-6, pp. 601-606 | DOI | MR | Zbl

[Ser97] Seress, Ákos An introduction to computational group theory, Notices Amer. Math. Soc., Volume 44 (1997) no. 6, pp. 671-679 | MR | Zbl

[Sim70] Sims, Charles C. Computational methods in the study of permutation groups, Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967), Pergamon, Oxford-New York-Toronto, Ont., 1970, pp. 169-183 | Zbl

[Sim80] Sims, Charles C. How to construct a Baby Monster, Finite simple groups II, Proc. Lond. Math. Soc. Res. Symp. (Univ. Durham 1978), Academic Press, 1980, pp. 339-345 | Zbl

Cité par Sources :