Quelle chapBib_mj.html Sprache: HTML

products/Sources/formale Sprachen/GAP/pkg/recog/doc/chapBib_mj.html

<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<script type="text/javascript"
 src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>
<title>GAP (recog) - References</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chapBib" onload="jscontent()">

<div class="chlinktop">Goto Chapter: <a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chap5_mj.html">5</a> <a href="chap6_mj.html">6</a> <a href="chap7_mj.html">7</a> <a href="chap8_mj.html">8</a> <a href="chap9_mj.html">9</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>

<div class="chlinkprevnexttop"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.html#contents">[Contents]</a> <a href="chap9_mj.html">[Previous Chapter]</a> <a href="chapInd_mj.html">[Next Chapter]</a> </div>

<a href="chapBib.html">[MathJax off]</a>
<a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a>

<h3>References</h3>

<a id="biBAB01" name="biBAB01"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1829468">AB01</a>] Altseimer, C. and Borovik, A. V.,
Probabilistic recognition of orthogonal and symplectic groups,
 in Groups and computation, III (Columbus, OH,
 1999),
de Gruyter, Berlin,
8
(2001),
1–20.


<a id="biBBB99" name="biBBB99"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1676609">BB99</a>] Babai, L. and Beals, R.,
A polynomial-time theory of black box groups. I,
 in Groups St. Andrews 1997 in Bath,
 I,
Cambridge Univ. Press, Cambridge,
London Math. Soc. Lecture Note Ser.,
260
(1999),
30–64.


<a id="biBBBS09" name="biBBBS09"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2780050">BBS09</a>] Babai, L., Beals, R. and Seress, Á.,
Polynomial-time theory of matrix groups,
 in STOC'09–-Proceedings of the 2009 ACM
 International
 Symposium on Theory of Computing,
ACM, New York
(2009),
55–64.


<a id="biBBHLGO15" name="biBBHLGO15"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=3283836">BHLO15</a>] Bäärnhielm, H., Holt, D., Leedham-Green, C. R. and O'Brien, E. A.,
A practical model for computation with matrix groups,
J. Symbolic Comput.,
68 (part 1)
(2015),
27–60 
(https://doi.org/10.1016/j.jsc.2014.08.006).


<a id="biBBK01" name="biBBK01"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1829473">BK01</a>] Brooksbank, P. A. and Kantor, W. M.,
On constructive recognition of a black box \({\rm
 PSL}(d,q)\),
 in Groups and computation, III (Columbus, OH,
 1999),
de Gruyter, Berlin,
Ohio State Univ. Math. Res. Inst. Publ.,
8
(2001),
95–111.


<a id="biBBK06" name="biBBK06"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2228648">BK06</a>] Brooksbank, P. A. and Kantor, W. M.,
Fast constructive recognition of black box orthogonal groups,
J. Algebra,
300 (1)
(2006),
256–288 
(https://doi.org/10.1016/j.jalgebra.2006.02.024).


<a id="biBBKPS02" name="biBBKPS02"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1931364">BKPS02</a>] Babai, L., Kantor, W. M., Pálfy, P. P. and Seress, Á.,
Black-box recognition of finite simple groups of Lie type by
 statistics of element orders,
J. Group Theory,
5 (4)
(2002),
383–401 
(https://doi.org/10.1515/jgth.2002.010).


<a id="biBBLGN+03" name="biBBLGN+03"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1953539">BLN+03</a>] Beals, R., Leedham-Green, C. R., Niemeyer, A. C., Praeger, C. E. and Seress, Á.,
A black-box group algorithm for recognizing finite symmetric
 and alternating groups. I,
Trans. Amer. Math. Soc.,
355 (5)
(2003),
2097–2113 
(https://doi.org/10.1090/S0002-9947-03-03040-X).


<a id="biBBLGN+05" name="biBBLGN+05"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2166794">BLN+05</a>] Beals, R., Leedham-Green, C. R., Niemeyer, A. C., Praeger, C. E. and Seress, Á.,
Constructive recognition of finite alternating and symmetric
 groups acting as matrix groups on their natural permutation
 modules,
J. Algebra,
292 (1)
(2005),
4–46 
(https://doi.org/10.1016/j.jalgebra.2005.01.035).


<a id="biBBLS97" name="biBBLS97"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1471984">BLS97</a>] Babai, L., Luks, E. M. and Seress, Á.,
Fast management of permutation groups. I,
SIAM J. Comput.,
26 (5)
(1997),
1310–1342 
(https://doi.org/10.1137/S0097539794229417).


<a id="biBBNS06" name="biBBNS06"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2257997">BNS06</a>] Brooksbank, P., Niemeyer, A. C. and Seress, Á.,
A reduction algorithm for matrix groups with an extraspecial
 normal subgroup,
 in Finite geometries, groups, and computation,
Walter de Gruyter, Berlin
(2006),
1–16.


<a id="biBBro01" name="biBBro01"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1829472">Bro01</a>] Brooksbank, P. A.,
A constructive recognition algorithm for the matrix group
 \(\Omega(d,q)\),
 in Groups and computation, III (Columbus, OH,
 1999),
de Gruyter, Berlin,
Ohio State Univ. Math. Res. Inst. Publ.,
8
(2001),
79–93.


<a id="biBBro03" name="biBBro03"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2051584">Bro03</a>] Brooksbank, P. A.,
Fast constructive recognition of black-box unitary groups,
LMS J. Comput. Math.,
6
(2003),
162–197 
(https://doi.org/10.1112/S1461157000000437).


<a id="biBBro08" name="biBBro08"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2422320">Bro08</a>] Brooksbank, P. A.,
Fast constructive recognition of black box symplectic groups,
J. Algebra,
320 (2)
(2008),
885–909 
(https://doi.org/10.1016/j.jalgebra.2008.03.021).


<a id="biBBS01" name="biBBS01"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1829470">BS01</a>] Babai, L. and Shalev, A.,
Recognizing simplicity of black-box groups and the frequency
 of \(p\)-singular elements in affine groups,
 in Groups and computation, III (Columbus, OH,
 1999),
de Gruyter, Berlin,
Ohio State Univ. Math. Res. Inst. Publ.,
8
(2001),
39–62.


<a id="biBCFL97" name="biBCFL97"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1444132">CFL97</a>] Cooperman, G., Finkelstein, L. and Linton, S.,
Constructive recognition of a black box group isomorphic to
 \({\rm GL}(n,2)\),
 in Groups and computation, II (New Brunswick,
 NJ, 1995),
Amer. Math. Soc., Providence, RI,
DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,
28
(1997),
85–100.


<a id="biBCLG97a" name="biBCLG97a"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1444130">CL97a</a>] Celler, F. and Leedham-Green, C. R.,
Calculating the order of an invertible matrix,
 in Groups and computation, II (New Brunswick,
 NJ, 1995),
Amer. Math. Soc., Providence, RI,
DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,
28
(1997),
55–60.


<a id="biBCLG97b" name="biBCLG97b"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1444131">CL97b</a>] Celler, F. and Leedham-Green, C. R.,
A non-constructive recognition algorithm for the special
 linear and other classical groups,
 in Groups and computation, II (New Brunswick,
 NJ, 1995),
Amer. Math. Soc., Providence, RI,
DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,
28
(1997),
61–67.


<a id="biBCLG98" name="biBCLG98"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1647410">CL98</a>] Celler, F. and Leedham-Green, C. R.,
A constructive recognition algorithm for the special linear
 group,
 in The atlas of finite groups: ten years on (Birmingham,
 1995),
Cambridge Univ. Press, Cambridge,
London Math. Soc. Lecture Note Ser.,
249
(1998),
11–26 
(https://doi.org/10.1017/CBO9780511565830.007).


<a id="biBCLG01" name="biBCLG01"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1829474">CL01</a>] Conder, M. and Leedham-Green, C. R.,
Fast recognition of classical groups over large fields,
 in Groups and computation, III (Columbus, OH,
 1999),
de Gruyter, Berlin,
Ohio State Univ. Math. Res. Inst. Publ.,
8
(2001),
113–121.


<a id="biBCLGM+95" name="biBCLGM+95"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1356111">CLM+95</a>] Celler, F., Leedham-Green, C. R., Murray, S. H., Niemeyer, A. C. and O'Brien, E. A.,
Generating random elements of a finite group,
Comm. Algebra,
23 (13)
(1995),
4931–4948 
(https://doi.org/10.1080/00927879508825509).


<a id="biBCLGO06" name="biBCLGO06"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2187651">CLO06</a>] Conder, M. D. E., Leedham-Green, C. R. and O'Brien, E. A.,
Constructive recognition of \({\rm PSL}(2,q)\),
Trans. Amer. Math. Soc.,
358 (3)
(2006),
1203–1221 
(https://doi.org/10.1090/S0002-9947-05-03756-6).


<a id="biBCNRD09" name="biBCNRD09"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2531214">CNR09</a>] Carlson, J. F., Neunhöffer, M. and Roney-Dougal, C. M.,
A polynomial-time reduction algorithm for groups of semilinear
 or subfield class,
J. Algebra,
322 (3)
(2009),
613–637 
(https://doi.org/10.1016/j.jalgebra.2009.04.022).


<a id="biBDLGLO13" name="biBDLGLO13"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=3081630">DLLO13</a>] Dietrich, H., Leedham-Green, C. R., Lübeck, F. and O'Brien, E. A.,
Constructive recognition of classical groups in even
 characteristic,
J. Algebra,
391
(2013),
227–255 
(https://doi.org/10.1016/j.jalgebra.2013.04.031).


<a id="biBDLGO15" name="biBDLGO15"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=3272392">DLO15</a>] Dietrich, H., Leedham-Green, C. R. and O'Brien, E. A.,
Effective black-box constructive recognition of classical
 groups,
J. Algebra,
421
(2015),
460–492 
(https://doi.org/10.1016/j.jalgebra.2014.08.039).


<a id="biBGH97" name="biBGH97"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1446124">GH97</a>] Glasby, S. P. and Howlett, R. B.,
Writing representations over minimal fields,
Comm. Algebra,
25 (6)
(1997),
1703–1711 
(https://doi.org/10.1080/00927879708825947).


<a id="biBGLGO06" name="biBGLGO06"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2188850">GLO06</a>] Glasby, S. P., Leedham-Green, C. R. and O'Brien, E. A.,
Writing projective representations over subfields,
J. Algebra,
295 (1)
(2006),
51–61 
(https://doi.org/10.1016/j.jalgebra.2005.03.037).


<a id="biBHLO+08" name="biBHLO+08"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2466905">HLO+08</a>] Holmes, P. E., Linton, S. A., O'Brien, E. A., Ryba, A. J. E. and Wilson, R. A.,
Constructive membership in black-box groups,
J. Group Theory,
11 (6)
(2008),
747–763 
(https://doi.org/10.1515/JGT.2008.047).


<a id="biBHLGOR96a" name="biBHLGOR96a"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1407872">HLOR96a</a>] Holt, D. F., Leedham-Green, C. R., O'Brien, E. A. and Rees, S.,
Computing matrix group decompositions with respect to a normal
 subgroup,
J. Algebra,
184 (3)
(1996),
818–838 
(https://doi.org/10.1006/jabr.1996.0286).


<a id="biBHLGOR96b" name="biBHLGOR96b"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1407871">HLOR96b</a>] Holt, D. F., Leedham-Green, C. R., O'Brien, E. A. and Rees, S.,
Testing matrix groups for primitivity,
J. Algebra,
184 (3)
(1996),
795–817 
(https://doi.org/10.1006/jabr.1996.0285).


<a id="biBHR94" name="biBHR94"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1279282">HR94</a>] Holt, D. F. and Rees, S.,
Testing modules for irreducibility,
J. Austral. Math. Soc. Ser. A,
57 (1)
(1994),
1–16.


<a id="biBIL00" name="biBIL00"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1795309">IL00</a>] Ivanyos, G. and Lux, K.,
Treating the exceptional cases of the MeatAxe,
Experiment. Math.,
9 (3)
(2000),
373–381 
(http://projecteuclid.org/euclid.em/1045604672).


<a id="biBJLNP13" name="biBJLNP13"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=3085037">JLNP13</a>] Jambor, S., Leuner, M., Niemeyer, A. C. and Plesken, W.,
Fast recognition of alternating groups of unknown degree,
J. Algebra,
392
(2013),
315–335 
(https://doi.org/10.1016/j.jalgebra.2013.06.005).


<a id="biBKK15" name="biBKK15"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=3272372">KK15</a>] Kantor, W. M. and Kassabov, M.,
Black box groups isomorphic to \(\rm {PGL}(2,2^e)\),
J. Algebra,
421
(2015),
16–26 
(https://doi.org/10.1016/j.jalgebra.2014.08.014).


<a id="biBKM13" name="biBKM13"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=3066774">KM13</a>] Kantor, W. M. and Magaard, K.,
Black box exceptional groups of Lie type,
Trans. Amer. Math. Soc.,
365 (9)
(2013),
4895–4931 
(https://doi.org/10.1090/S0002-9947-2013-05822-9).


<a id="biBKM15" name="biBKM15"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=3272395">KM15</a>] Kantor, W. M. and Magaard, K.,
Black box exceptional groups of Lie type II,
J. Algebra,
421
(2015),
524–540 
(https://doi.org/10.1016/j.jalgebra.2014.09.003).


<a id="biBKS09" name="biBKS09"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2531224">KS09</a>] Kantor, W. M. and Seress, Á.,
Large element orders and the characteristic of Lie-type
 simple groups,
J. Algebra,
322 (3)
(2009),
802–832 
(https://doi.org/10.1016/j.jalgebra.2009.05.004).


<a id="biBLG01" name="biBLG01"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1829483">Lee01</a>] Leedham-Green, C. R.,
The computational matrix group project,
 in Groups and computation, III (Columbus, OH,
 1999),
de Gruyter, Berlin,
Ohio State Univ. Math. Res. Inst. Publ.,
8
(2001),
229–247.


<a id="biBLMO07" name="biBLMO07"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2356848">LMO07</a>] Lübeck, F., Magaard, K. and O'Brien, E. A.,
Constructive recognition of \({\rm SL}_3(q)\),
J. Algebra,
316 (2)
(2007),
619–633 
(https://doi.org/10.1016/j.jalgebra.2007.01.020).


<a id="biBLNPS06" name="biBLNPS06"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2221258">LNPS06</a>] Law, M., Niemeyer, A. C., Praeger, C. E. and Seress, Á.,
A reduction algorithm for large-base primitive permutation
 groups,
LMS J. Comput. Math.,
9
(2006),
159–173 
(https://doi.org/10.1112/S1461157000001236).


<a id="biBLGO97a" name="biBLGO97a"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1470352">LO97a</a>] Leedham-Green, C. R. and O'Brien, E. A.,
Recognising tensor products of matrix groups,
Internat. J. Algebra Comput.,
7 (5)
(1997),
541–559 
(https://doi.org/10.1142/S0218196797000241).


<a id="biBLGO97b" name="biBLGO97b"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1438187">LO97b</a>] Leedham-Green, C. R. and O'Brien, E. A.,
Tensor products are projective geometries,
J. Algebra,
189 (2)
(1997),
514–528 
(https://doi.org/10.1006/jabr.1996.6881).


<a id="biBLGO02" name="biBLGO02"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1925006">LO02</a>] Leedham-Green, C. R. and O'Brien, E. A.,
Recognising tensor-induced matrix groups,
J. Algebra,
253 (1)
(2002),
14–30 
(https://doi.org/10.1016/S0021-8693(02)00041-8).


<a id="biBLO07" name="biBLO07"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2352733">LO07</a>] Liebeck, M. W. and O'Brien, E. A.,
Finding the characteristic of a group of Lie type,
J. Lond. Math. Soc. (2),
75 (3)
(2007),
741–754 
(https://doi.org/10.1112/jlms/jdm028).


<a id="biBLGO09" name="biBLGO09"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2531225">LO09</a>] Leedham-Green, C. R. and O'Brien, E. A.,
Constructive recognition of classical groups in odd
 characteristic,
J. Algebra,
322 (3)
(2009),
833–881 
(https://doi.org/10.1016/j.jalgebra.2009.04.028).


<a id="biBLO16" name="biBLO16"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=3461031">LO16</a>] Liebeck, M. W. and O'Brien, E. A.,
Recognition of finite exceptional groups of Lie type,
Trans. Amer. Math. Soc.,
368 (9)
(2016),
6189–6226 
(https://doi.org/10.1090/tran/6534).


<a id="biBNeu09" name="biBNeu09"></a>

[Neu09] Neunhöffer, M.,
Constructive Recognition of Finite Groups,
Habilitation thesis,
RWTH Aachen
(2009) 
(https://github.com/neunhoef/habil).


<a id="biBNie05" name="biBNie05"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2142090">Nie05</a>] Niemeyer, A. C.,
Constructive recognition of normalizers of small extra-special
 matrix groups,
Internat. J. Algebra Comput.,
15 (2)
(2005),
367–394 
(https://doi.org/10.1142/S021819670500230X).


<a id="biBNP92" name="biBNP92"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1182102">NP92</a>] Neumann, P. M. and Praeger, C. E.,
A recognition algorithm for special linear groups,
Proc. London Math. Soc. (3),
65 (3)
(1992),
555–603 
(https://doi.org/10.1112/plms/s3-65.3.555).


<a id="biBNP97" name="biBNP97"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1444141">NP97</a>] Niemeyer, A. C. and Praeger, C. E.,
Implementing a recognition algorithm for classical groups,
 in Groups and computation, II (New Brunswick,
 NJ, 1995),
Amer. Math. Soc., Providence, RI,
DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,
28
(1997),
273–296.


<a id="biBNP98" name="biBNP98"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1625479">NP98</a>] Niemeyer, A. C. and Praeger, C. E.,
A recognition algorithm for classical groups over finite
 fields,
Proc. London Math. Soc. (3),
77 (1)
(1998),
117–169 
(https://doi.org/10.1112/S0024611598000422).


<a id="biBNP99" name="biBNP99"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1717416">NP99</a>] Niemeyer, A. C. and Praeger, C. E.,
A recognition algorithm for non-generic classical groups over
 finite fields,
J. Austral. Math. Soc. Ser. A,
67 (2)
(1999),
223–253.


<a id="biBNS06" name="biBNS06"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=MR2289128">NS06</a>] Neunhöffer, M. and Seress, Á.,
A data structure for a uniform approach to computations with
 finite groups,
 in ISSAC 2006,
ACM,
New York
(2006),
254–261 
(https://doi.org/10.1145/1145768.1145811).


<a id="biBO'B06" name="biBO'B06"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2258009">O'B06] '>O'Brien, E. A.,
Towards effective algorithms for linear groups,
 in Finite geometries, groups, and computation,
Walter de Gruyter, Berlin
(2006),
163–190.


<a id="biBO'B11" name="biBO'B11"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=2858866">O'B11] '>O'Brien, E. A.,
Algorithms for matrix groups,
 in Groups St Andrews 2009 in Bath.
 Volume 2,
Cambridge Univ. Press, Cambridge,
London Math. Soc. Lecture Note Ser.,
388
(2011),
297–323.


<a id="biBPak00" name="biBPak00"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1931844">Pak00</a>] Pak, I.,
The product replacement algorithm is polynomial,
 in 41st Annual Symposium on Foundations of
 Computer
 Science (Redondo Beach, CA, 2000),
IEEE Comput. Soc. Press, Los Alamitos, CA
(2000),
476–485 
(https://doi.org/10.1109/SFCS.2000.892135).


<a id="biBPar84" name="biBPar84"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=760660">Par84</a>] Parker, R. A.,
The computer calculation of modular characters (the meat-axe),
 in Computational group theory (Durham, 1982),
Academic Press, London
(1984),
267–274.


<a id="biBPra99" name="biBPra99"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1676657">Pra99</a>] Praeger, C. E.,
Primitive prime divisor elements in finite classical groups,
 in Groups St. Andrews 1997 in Bath,
 II,
Cambridge Univ. Press, Cambridge,
London Math. Soc. Lecture Note Ser.,
261
(1999),
605–623 
(https://doi.org/10.1017/CBO9780511666148.024).


<a id="biBSer03" name="biBSer03"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1970241">Ser03</a>] Seress, Á.,
Permutation group algorithms,
Cambridge University Press, Cambridge,
Cambridge Tracts in Mathematics,
152
(2003),
x+264 pages 
(https://doi.org/10.1017/CBO9780511546549).


 

<div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.html#contents">[Contents]</a> <a href="chap9_mj.html">[Previous Chapter]</a> <a href="chapInd_mj.html">[Next Chapter]</a> </div>

<div class="chlinkbot">Goto Chapter: <a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chap5_mj.html">5</a> <a href="chap6_mj.html">6</a> <a href="chap7_mj.html">7</a> <a href="chap8_mj.html">8</a> <a href="chap9_mj.html">9</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>

<hr />
generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a>
</body>
</html>

quality98%

¤ Dauer der Verarbeitung: 0.15 Sekunden (vorverarbeitet) ¤

*© Formatika GbR, Deutschland

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.