Ziele Untersuchung
mit Columbo Integrität von
Datenbanken Interaktion und
Portierbarkeit Ergonomie der
Schnittstellen

Angebot Produkte Projekt Beratung

Mittel Analytik Modellierung Sprachen Algebra Logik Hardware Denken Kreativität

Zusammenhänge Gesellschaft Wirtschaft Branche Firma


Quellcodebibliothek Statistik Leitseite products/sources/formale Sprachen/GAP/doc/ref/ (Browser von der Mozilla Stiftung Version 136.0.1^©) Datei vom 18.9.2025 mit Größe 75 kB

Quelle chapBib.html Sprache: HTML

products/sources/formale Sprachen/GAP/doc/ref/chapBib.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>
<title>GAP (ref) - 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.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chap10.html">10</a> <a href="chap11.html">11</a> <a href="chap12.html">12</a> <a href="chap13.html">13</a> <a href="chap14.html">14</a> <a href="chap15.html">15</a> <a href="chap16.html">16</a> <a href="chap17.html">17</a> <a href="chap18.html">18</a> <a href="chap19.html">19</a> <a href="chap20.html">20</a> <a href="chap21.html">21</a> <a href="chap22.html">22</a> <a href="chap23.html">23</a> <a href="chap24.html">24</a> <a href="chap25.html">25</a> <a href="chap26.html">26</a> <a href="chap27.html">27</a> <a href="chap28.html">28</a> <a href="chap29.html">29</a> <a href="chap30.html">30</a> <a href="chap31.html">31</a> <a href="chap32.html">32</a> <a href="chap33.html">33</a> <a href="chap34.html">34</a> <a href="chap35.html">35</a> <a href="chap36.html">36</a> <a href="chap37.html">37</a> <a href="chap38.html">38</a> <a href="chap39.html">39</a> <a href="chap40.html">40</a> <a href="chap41.html">41</a> <a href="chap42.html">42</a> <a href="chap43.html">43</a> <a href="chap44.html">44</a> <a href="chap45.html">45</a> <a href="chap46.html">46</a> <a href="chap47.html">47</a> <a href="chap48.html">48</a> <a href="chap49.html">49</a> <a href="chap50.html">50</a> <a href="chap51.html">51</a> <a href="chap52.html">52</a> <a href="chap53.html">53</a> <a href="chap54.html">54</a> <a href="chap55.html">55</a> <a href="chap56.html">56</a> <a href="chap57.html">57</a> <a href="chap58.html">58</a> <a href="chap59.html">59</a> <a href="chap60.html">60</a> <a href="chap61.html">61</a> <a href="chap62.html">62</a> <a href="chap63.html">63</a> <a href="chap64.html">64</a> <a href="chap65.html">65</a> <a href="chap66.html">66</a> <a href="chap67.html">67</a> <a href="chap68.html">68</a> <a href="chap69.html">69</a> <a href="chap70.html">70</a> <a href="chap71.html">71</a> <a href="chap72.html">72</a> <a href="chap73.html">73</a> <a href="chap74.html">74</a> <a href="chap75.html">75</a> <a href="chap76.html">76</a> <a href="chap77.html">77</a> <a href="chap78.html">78</a> <a href="chap79.html">79</a> <a href="chap80.html">80</a> <a href="chap81.html">81</a> <a href="chap82.html">82</a> <a href="chap83.html">83</a> <a href="chap84.html">84</a> <a href="chap85.html">85</a> <a href="chap86.html">86</a> <a href="chap87.html">87</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap87.html">[Previous Chapter]</a> <a href="chapInd.html">[Next Chapter]</a> </div>

<a href="chapBib_mj.html">[MathJax on]</a>
<a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a>

<h3>References</h3>

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

[<a href="https://www.ams.org/mathscinet-getitem?mr=679157">AMW82</a>] Arrell, D. G., Manrai, S. and Worboys, M. F. (Campbell, C. M. and Robertson, E. F., Eds.),
A procedure for obtaining simplified defining relations for a
 subgroup,
 in Groups–St Andrews 1981 (St Andrews, 1981),
Cambridge Univ. Press,
London Math. Soc. Lecture Note Ser.,
71,
Cambridge
(1982),
155–159.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=760644">AR84</a>] Arrell, D. G. and Robertson, E. F. (Atkinson, M. D., Ed.),
A modified Todd-Coxeter algorithm,
 in Computational group theory (Durham, 1982),
Academic Press,
London
(1984),
27–32.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0392905">Art73</a>] Artin, E.,
Galoissche Theorie,
Verlag Harri Deutsch,
Zurich
(1973),
86 pages 
(Übersetzung nach der zweiten englischen Auflage besorgt von
 Viktor Ziegler,
 Mit einem Anhang von N. A. Milgram,
 Zweite, unveränderte Auflage,
 Deutsch-Taschenbücher, No. 21).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=781734">Bak84</a>] Baker, A.,
A concise introduction to the theory of numbers,
Cambridge University Press,
Cambridge
(1984),
xiii+95 pages.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0399265">BC76</a>] Beetham, M. J. and Campbell, C. M.,
A note on the Todd-Coxeter coset enumeration
 algorithm,
Proc. Edinburgh Math. Soc. (2),
20 (1)
(1976),
73–79.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=968150">BC89</a>] Brent, R. P. and Cohen, G. L.,
A new lower bound for odd perfect numbers,
Math. Comp.,
53 (187)
(1989),
431–437, S7–S24.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1226811">BC94</a>] Baum, U. and Clausen, M.,
Computing irreducible representations of supersolvable groups,
Math. Comp.,
63 (207)
(1994),
351–359.


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

[BCFS91] Babai, L., Cooperman, G., Finkelstein, L. and Seress, Á.,
Nearly Linear Time Algorithms for Permutation Groups
 with a Small Base,
 in Proceedings of the International Symposium on Symbolic
 and Algebraic Computation (ISSAC'91), Bonn 1991,
ACM Press
(1991),
200–209.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1681346">BE99</a>] Besche, H. U. and Eick, B.,
Construction of finite groups,
J. Symbolic Comput.,
27 (4)
(1999),
387–404.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0396729">Ber76</a>] Berger, T. R.,
Characters and derived length in groups of odd order,
J. Algebra,
39 (1)
(1976),
199–207.


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

[Bes92] Besche, H. U.,
Die Berechnung von Charaktergraden und
 Charakteren endlicher auflösbarer
 Gruppen im Computeralgebrasystem GAP,
Diplomarbeit,
Lehrstuhl D für Mathematik,
 Rheinisch Westfälische
 Technische Hochschule,
Aachen, Germany
(1992).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=554857">BFS79</a>] Beyl, F. R., Felgner, U. and Schmid, P.,
On groups occurring as center factor groups,
J. Algebra,
61 (1)
(1979),
161–177.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=913203">BJR87</a>] Brown, R., Johnson, D. L. and Robertson, E. F.,
Some computations of nonabelian tensor products of groups,
J. Algebra,
111 (1)
(1987),
177–202.


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

[BL98] Breuer, T. and Linton, S.,
The GAP 4 Type System. Organizing Algebraic
 Algorithms,
 in ISSAC '98: Proceedings of the 1998 international symposium on
 Symbolic and algebraic computation,
ACM Press,
New York, NY, USA
(1998),
38–45 
(Chairman: Volker Weispfenning and Barry Trager).


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

[BLS75] Brillhart, J., Lehmer, D. and Selfridge, J.,
<a href="https://doi.org/10.2307/2005583">New primality criteria and factorizations of 2^m ± 1</a>,
Mathematics of Computation,
29
(1975),
620–647.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0274237">Bou70</a>] Bourbaki, N.,
Éléments de mathématique. Algèbre. Chapitres 1
 à 3,
Hermann,
Paris
(1970),
xiii+635 pp. (not consecutively paged) pages.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1633876">BP98</a>] Breuer, T. and Pfeiffer, G.,
Finding possible permutation characters,
J. Symbolic Comput.,
26 (3)
(1998),
343–354.


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

[Bre91] Breuer, T.,
Potenzabbildungen, Untergruppenfusionen,
 Tafel-Automorphismen,
Diplomarbeit,
Lehrstuhl D für Mathematik, Rheinisch Westfälische
 Technische Hochschule,
Aachen, Germany
(1991).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1464789">Bre97</a>] Breuer, T.,
Integral bases for subfields of cyclotomic fields,
Appl. Algebra Engrg. Comm. Comput.,
8 (4)
(1997),
279–289.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1687309">Bre99</a>] Breuer, T.,
Computing possible class fusions from character tables,
Comm. Algebra,
27 (6)
(1999),
2733–2748.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1227929">BTW93</a>] Beauzamy, B., Trevisan, V. and Wang, P. S.,
Polynomial factorization: sharp bounds, efficient algorithms,
J. Symbolic Comput.,
15 (4)
(1993),
393–413.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0069818">Bur55</a>] Burnside, W.,
Theory of groups of finite order,
Dover Publications Inc.,
New York
(1955),
xxiv+512 pages 
(Unabridged republication of the second edition,
 published in 1911).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0318322">Can73</a>] Cannon, J. J.,
Construction of defining relators for finite groups,
Discrete Math.,
5
(1973),
105–129.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0407163">Car72</a>] Carter, R. W.,
Simple groups of Lie type,
John Wiley & Sons, London-New York-Sydney
(1972),
viii+331 pages 
(Pure and Applied Mathematics, Vol. 28).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=827219">CCN+85</a>] Conway, J. H., Curtis, R. T., Norton, S. P., Parker, R. A. and Wilson, R. A.,
Atlas of finite groups,
Oxford University Press,
Eynsham
(1985),
xxxiv+252 pages 
(Maximal subgroups and ordinary characters for simple groups,
 With computational assistance from J. G. Thackray).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1417938">CLO97</a>] Cox, D., Little, J. and O'Shea, D.,
Ideals, varieties, and algorithms,
Springer-Verlag,
Second edition,
Undergraduate Texts in Mathematics,
New York
(1997),
xiv+536 pages 
(An introduction to computational algebraic geometry and
 commutative algebra).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1228206">Coh93</a>] Cohen, H.,
A course in computational algebraic number theory,
Springer-Verlag,
Graduate Texts in Mathematics,
138,
Berlin
(1993),
xii+534 pages.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1075421">Con90a</a>] Conlon, S. B.,
Calculating characters of p-groups,
J. Symbolic Comput.,
9 (5-6)
(1990),
535–550 
(Computational group theory, Part 1).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1075422">Con90b</a>] Conlon, S. B.,
Computing modular and projective character degrees of soluble
 groups,
J. Symbolic Comput.,
9 (5-6)
(1990),
551–570 
(Computational group theory, Part 1).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0224726">Dix67</a>] Dixon, J. D.,
High speed computation of group characters,
Numer. Math.,
10
(1967),
446–450.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1235797">Dix93</a>] Dixon, J. D. (Finkelstein, L. and Kantor, W. M., Eds.),
Constructing representations of finite groups,
 in Groups and computation (New Brunswick, NJ, 1991),
Amer. Math. Soc.,
DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,
11,
Providence, RI
(1993),
105–112.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0248239">Dre69</a>] Dress, A.,
A characterisation of solvable groups,
Math. Z.,
110
(1969),
213–217.


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

[EH01] Eick, B. and Hulpke, A.,
Computing the maximal subgroups of a permutation group I,
155–168.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1444133">Eic97</a>] Eick, B. (Finkelstein, L. and Kantor, W. M., Eds.),
Special presentations for finite soluble groups and computing
 (pre-)Frattini subgroups,
 in Groups and computation, II (New Brunswick, NJ, 1995),
Amer. Math. Soc.,
DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,
28,
Providence, RI
(1997),
101–112.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1697585">Ell98</a>] Ellis, G.,
On the capability of groups,
Proc. Edinburgh Math. Soc. (2),
41 (3)
(1998),
487–495.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1342790">FJNT95</a>] Felsch, V., Johnson, D. L., Neubüser, J. and Tsaranov, S. V.,
The structure of certain Coxeter groups,
 in Groups '93 Galway/St Andrews, Vol. 1 (Galway, 1993),
Cambridge Univ. Press,
London Math. Soc. Lecture Note Ser.,
211,
Cambridge
(1995),
177–190.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=575705">FN79</a>] Felsch, V. and Neubüser, J. (Ng, E. W., Ed.),
An algorithm for the computation of conjugacy classes and
 centralizers in p-groups,
 in Symbolic and algebraic computation (EUROSAM '79, Internat.
 Sympos., Marseille, 1979),
Springer,
Lecture Notes in Comput. Sci.,
72,
Berlin
(1979),
452–465 
(EUROSAM '79, an International Symposium held in Marseille,
 June 1979).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=667230">Fra82</a>] Frame, J. S.,
Recursive computation of tensor power components,
Bayreuth. Math. Schr.,
10
(1982),
153–159.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1341759">GW95</a>] Gow, R. and Willems, W.,
<a href="https://doi.org/10.1006/jabr.1995.1227">Methods to decide if simple self-dual modules over fields of
 characteristic 2 are of quadratic type</a>,
J. Algebra,
175 (3)
(1995),
1067–1081.


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

[Hal34] Hall, P.,
<a href="https://doi.org/10.1112/plms/s2-36.1.29">A contribution to the theory of groups of prime-power order</a>,
Proceedings of the London Mathematical Society,
s2-36 (1)
(1934),
29–95.


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

[Hal36] Hall, P.,
<a href="https://doi.org/10.1112/plms/s2-40.1.468">On a Theorem of Frobenius</a>,
Proceedings of the London Mathematical Society,
s2-40 (1)
(1936),
468–501.


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

[Hav69] Havas, G.,
Symbolic and Algebraic Calculation,
Basser Computing Dept., Technical Report,
Basser Department of Computer Science, University of
 Sydney (89),
Sydney, Australia
(1969).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0376827">Hav74</a>] Havas, G. (Newman, M. F., Ed.),
A Reidemeister-Schreier program,
 in Proceedings of the Second International Conference on the
 Theory of Groups (Australian Nat. Univ., Canberra, 1973),
Springer,
Lecture Notes in Math.,
372,
Berlin
(1974),
347–356. Lecture Notes in Math., Vol. 372 
(Held at the Australian National University, Canberra, August
 13–24, 1973,
 With an introduction by B. H. Neumann,
 Lecture Notes in Mathematics, Vol. 372).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=650245">HB82</a>] Huppert, B. and Blackburn, N.,
Finite groups. II,
Springer-Verlag,
Grundlehren Math. Wiss.,
242,
Berlin
(1982),
xiii+531 pages.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1039540">HIÖ89</a>] Hawkes, T., Isaacs, I. M. and Özaydin, M.,
On the Möbius function of a finite group,
Rocky Mountain J. Math.,
19 (4)
(1989),
1003–1034.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0103215">HJ59</a>] Hall Jr., M.,
The theory of groups,
The Macmillan Co.,
New York, N.Y.
(1959),
xiii+434 pages.


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

[HJLP] Hiss, G., Jansen, C., Lux, K. and Parker, R. A.,
Computational Modular Character Theory,
<a href="http://www.math.rwth-aachen.de/~MOC/CoMoChaT/">http://www.math.rwth-aachen.de/~MOC/CoMoChaT/</a>.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=760651">HKRR84</a>] Havas, G., Kenne, P. E., Richardson, J. S. and Robertson, E. F. (Atkinson, M. D., Ed.),
A Tietze transformation program,
 in Computational group theory (Durham, 1982),
Academic Press,
London
(1984),
69–73.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0466355">How76</a>] Howie, J. M.,
An introduction to semigroup theory,
Academic Press [Harcourt Brace Jovanovich Publishers],
London
(1976),
x+272 pages 
(L.M.S. Monographs, No. 7).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1025760">HP89</a>] Holt, D. F. and Plesken, W.,
Perfect groups,
The Clarendon Press Oxford University Press,
Oxford Mathematical Monographs,
New York
(1989),
xii+364 pages 
(With an appendix by W. Hanrath,
 Oxford Science Publications).


<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="biBHulpke93" name="biBHulpke93"></a>

[Hul93] Hulpke, A.,
Zur Berechnung von Charaktertafeln,
Diplomarbeit,
Lehrstuhl D für Mathematik,
 Rheinisch Westfälische
 Technische Hochschule
(1993).


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

[Hul96] Hulpke, A.,
Konstruktion transitiver Permutationsgruppen,
Dissertation,
Verlag der Augustinus Buchhandlung, Aachen,
Rheinisch Westfälische
 Technische Hochschule,
Aachen, Germany
(1996).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1805183">Hul98</a>] Hulpke, A.,
Computing normal subgroups,
 in Proceedings of the 1998 International Symposium on Symbolic
 and Algebraic Computation (Rostock),
ACM,
New York
(1998),
194–198 (electronic) 
(Chairman: Volker Weispfenning and Barry Trager).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1681348">Hul99</a>] Hulpke, A.,
Computing subgroups invariant under a set of automorphisms,
J. Symbolic Comput.,
27 (4)
(1999),
415–427.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1659847">Hul00</a>] Hulpke, A.,
Conjugacy classes in finite permutation groups via homomorphic
 images,
Math. Comp.,
69 (232)
(2000),
1633–1651.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1917425">Hul01</a>] Hulpke, A.,
Representing subgroups of finitely presented groups by
 quotient subgroups,
Experiment. Math.,
10 (3)
(2001),
369–381.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0323842">Hum72</a>] Humphreys, J. E.,
Introduction to Lie algebras and representation theory,
Springer-Verlag,
New York
(1972),
xii+169 pages 
(Graduate Texts in Mathematics, Vol. 9).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=499562">Hum78</a>] Humphreys, J. E.,
Introduction to Lie algebras and representation theory,
Springer-Verlag,
Graduate Texts in Mathematics,
9,
New York
(1978),
xii+171 pages 
(Second printing, revised).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0224703">Hup67</a>] Huppert, B.,
Endliche Gruppen. I,
Springer-Verlag,
Die Grundlehren der Mathematischen Wissenschaften, Band 134,
Berlin
(1967),
xii+793 pages.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1272584">IE94</a>] Ishibashi, H. and Earnest, A. G.,
Two-element generation of orthogonal groups over finite
 fields,
J. Algebra,
165 (1)
(1994),
164–171.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0460423">Isa76</a>] Isaacs, I. M.,
Character theory of finite groups,
Academic Press [Harcourt Brace Jovanovich Publishers],
New York
(1976),
xii+303 pages 
(Pure and Applied Mathematics, No. 69).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=644144">JK81</a>] James, G. and Kerber, A.,
The representation theory of the symmetric group,
Addison-Wesley Publishing Co., Reading, Mass.,
Encyclopedia of Mathematics and its Applications,
16
(1981),
xxviii+510 pages 
(With a foreword by P. M. Cohn,
 With an introduction by Gilbert de B. Robinson).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1367961">JLPW95</a>] Jansen, C., Lux, K., Parker, R. and Wilson, R.,
An atlas of Brauer characters,
The Clarendon Press Oxford University Press,
London Mathematical Society Monographs. New Series,
11,
New York
(1995),
xviii+327 pages 
(Appendix 2 by T. Breuer and S. Norton,
 Oxford Science Publications).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1472735">Joh97</a>] Johnson, D. L.,
Presentations of groups,
Cambridge University Press,
Second edition,
London Mathematical Society Student Texts,
15,
Cambridge
(1997),
xii+216 pages.


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

[Kau92] Kaup, A.,
Gitterbasen und Charaktere endlicher Gruppen,
Diplomarbeit,
Lehrstuhl D für Mathematik,
 Rheinisch Westfälische
 Technische Hochschule,
Aachen, Germany
(1992).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1057341">KL90</a>] Kleidman, P. and Liebeck, M.,
The subgroup structure of the finite classical groups,
Cambridge University Press,
London Mathematical Society Lecture Note Series,
129,
Cambridge
(1990),
x+303 pages.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0206169">Kli66</a>] Klimyk, A. U.,
Decomposition of the direct product of irreducible
 representations of semisimple Lie algebras into irreducible
 representations,
Ukrain. Mat. Ž.,
18 (5)
(1966),
19–27.


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

[Kli68] Klimyk, A. U.,
Decomposition of a direct product of irreducible
 representations of a semisimple Lie algebra into
 irreducible representations,
 in American Mathematical Society Translations.
 Series 2,
American Mathematical Society,
76,
Providence, R.I.
(1968),
63–73.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1842506">KLM01</a>] Kemper, G., Lübeck, F. and Magaard, K.,
Matrix generators for the Ree groups
 ^2G_2(q),
Comm. Algebra,
29 (1)
(2001),
407–413.


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

[Knu98] Knuth, D. E.,
The Art of Computer Programming, Volume 2:
 Seminumerical Algorithms,
Addison-Wesley,
third edition
(1998).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=282947">Lan70</a>] Lang, S.,
Algebraic number theory,
Addison-Wesley Publishing Co., Reading, Mass.-London-Don
 Mills, Ont.
(1970),
xi+354 pages.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1146516">Leo91</a>] Leon, J. S.,
Permutation group algorithms based on partitions. I.
 Theory and algorithms,
J. Symbolic Comput.,
12 (4-5)
(1991),
533–583 
(Computational group theory, Part 2).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=682664">LLJL82</a>] Lenstra, A. K., Lenstra Jr., H. W. and Lovász, L.,
Factoring polynomials with rational coefficients,
Math. Ann.,
261 (4)
(1982),
515–534.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=760654">LNS84</a>] Laue, R., Neubüser, J. and Schoenwaelder, U. (Atkinson, M. D., Ed.),
Algorithms for finite soluble groups and the SOGOS
 system,
 in Computational group theory (Durham, 1982),
Academic Press,
London
(1984),
105–135.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1112157">LP91</a>] Lux, K. and Pahlings, H. (Michler, G. O. and Ringel, C. M., Eds.),
Computational aspects of representation theory of finite
 groups,
 in Representation theory of finite groups and finite-dimensional
 algebras (Bielefeld, 1991),
Birkhäuser,
Progr. Math.,
95,
Basel
(1991),
37–64.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1445430">LRW97</a>] Luks, E. M., Rákóczi, F. and Wright, C. R. B.,
Some algorithms for nilpotent permutation groups,
J. Symbolic Comput.,
23 (4)
(1997),
335–354.


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

[Lüb03] Lübeck, F.,
Conway polynomials for finite fields
(2003),
<a href="http://www.math.rwth-aachen.de:8001/~Frank.Luebeck/data/ConwayPol">http://www.math.rwth-aachen.de:8001/~Frank.Luebeck/data/ConwayPol</a>.


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

[Maa10] Maas, L.,
<a href="https://arxiv.org/abs/0911.3794">On a construction of the basic spin representations of symmetric groups</a>,
Communications in Algebra,
38
(2010),
4545–4552.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=615131">Mac81</a>] Macdonald, I. G.,
Numbers of conjugacy classes in some finite classical groups,
Bull. Austral. Math. Soc.,
23 (1)
(1981),
23–48.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1012835">MN89</a>] Mecky, M. and Neubüser, J.,
Some remarks on the computation of conjugacy classes of
 soluble groups,
Bull. Austral. Math. Soc.,
40 (2)
(1989),
281–292.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0103933">Mur58</a>] Murnaghan, F. D.,
The orthogonal and symplectic groups,
Comm. Dublin Inst. Adv. Studies. Ser. A, no.,
13
(1958),
146.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1484546">MV97</a>] Mahajan, M. and Vinay, V.,
Determinant: combinatorics, algorithms, and complexity,
Chicago J. Theoret. Comput. Sci.
(1997),
Article 5, 26 pp. (electronic).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=521296">MY79</a>] McKay, J. and Young, K. C.,
The nonabelian simple groups G,
 |G| < 10^6–minimal generating pairs,
Math. Comp.,
33 (146)
(1979),
812–814.


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

[Neb95] Nebe, G.,
Endliche rationale Matrixgruppen vom Grad 24,
Dissertation,
Rheinisch Westfälische Technische Hochschule,
Aachener Beiträge zur Mathematik,
12,
Aachen, Germany
(1995).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1390378">Neb96</a>] Nebe, G.,
Finite subgroups of GL_n(Q) for
 25 ≤ n ≤ 31,
Comm. Algebra,
24 (7)
(1996),
2341–2397.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=679153">Neu82</a>] Neubüser, J. (Campbell, C. M. and Robertson, E. F., Eds.),
An elementary introduction to coset table methods in
 computational group theory,
 in Groups–St Andrews 1981 (St Andrews, 1981),
Cambridge Univ. Press,
London Math. Soc. Lecture Note Ser.,
71,
Cambridge
(1982),
1–45.


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

[Neu92] Neukirch, J.,
Algebraische Zahlentheorie,
Springer, Berlin, Heidelberg and New York
(1992).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1037607">New90</a>] Newman, M. F.,
Proving a group infinite,
Arch. Math. (Basel),
54 (3)
(1990),
209–211.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1265024">NP95b</a>] Nebe, G. and Plesken, W.,
Finite rational matrix groups of degree 16,
Mem. Amer. Math. Soc.,
AMS,
116 (556)
(1995),
74–144.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=760658">NPP84</a>] Neubüser, J., Pahlings, H. and Plesken, W. (Atkinson, M. D., Ed.),
CAS; design and use of a system for the handling of
 characters of finite groups,
 in Computational group theory (Durham, 1982),
Academic Press,
London
(1984),
195–247.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1193087">Pah93</a>] Pahlings, H.,
On the Möbius function of a finite group,
Arch. Math. (Basel),
60 (1)
(1993),
7–14.


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

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


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

[Pfe91] Pfeiffer, G.,
Von Permutationscharakteren und Markentafeln,
Diplomarbeit,
Lehrstuhl D für Mathematik,
 Rheinisch Westfälische
 Technische Hochschule,
Aachen, Germany
(1991).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1481593">Pfe97</a>] Pfeiffer, G.,
The subgroups of M_24, or how to compute the table of
 marks of a finite group,
Experiment. Math.,
6 (3)
(1997),
247–270.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=812182">Ple85</a>] Plesken, W.,
Finite unimodular groups of prime degree and circulants,
J. Algebra,
97 (1)
(1985),
286–312.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1344572">Ple95</a>] Plesken, W.,
Solving XX^ tr = A over the integers,
Linear Algebra Appl.,
226/228
(1995),
331--344.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1265024">PN95</a>] Plesken, W. and Nebe, G.,
Finite rational matrix groups,
Mem. Amer. Math. Soc.,
AMS,
116 (556)
(1995),
1–73.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=908420">Poh87</a>] Pohst, M.,
A modification of the LLL reduction algorithm,
J. Symbolic Comput.,
4 (1)
(1987),
123–127.


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

[PP77] Plesken, W. and Pohst, M.,
On maximal finite irreducible Subgroups of GL(n,Z).
 I. The five and seven dimensional cases, II. The
 six dimensional case,
Math. Comp.,
31
(1977),
536–576.


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

[PP80] Plesken, W. and Pohst, M.,
On maximal finite irreducible Subgroups of GL(n,Z).
 III. The nine dimensional case, IV. Remarks on
 even dimensions with application to n = 8, V. The
 eight dimensional case and a complete description of
 dimensions less than ten,
Math. Comp.,
34
(1980),
245–301.


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

[Rin93] Ringe, M.,
The C MeatAxe, Release 1.5,
Lehrstuhl D für Mathematik,
 Rheinisch Westfälische
 Technische Hochschule,
Aachen, Germany
(1993).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=961370">Rob88</a>] Robertson, E. F.,
Tietze transformations with weighted substring search,
J. Symbolic Comput.,
6 (1)
(1988),
59–64.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1615330">RT98</a>] Rylands, L. J. and Taylor, D. E.,
Matrix generators for the orthogonal groups,
J. Symbolic Comput.,
25 (3)
(1998),
351–360.


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

[Sch11] Schur, J.,
<a href="http://www.digizeitschriften.de/resolveppn/GDZPPN002167298">Über die Darstellung der symmetrischen und der alternierenden Gruppe durch gebrochene lineare Substitutionen</a>,
Journal für die reine und angewandte Mathematik,
139
(1911),
155–250.


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=1075426">Sch90</a>] Schneider, G. J. A.,
Dixon's character table algorithm revisited,
J. Symbolic Comput.,
9 (5-6)
(1990),
601–606 
(Computational group theory, Part 1).


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

[Sch92] Scherner, M.,
Erweiterung einer Arithmetik von
 Kreisteilungskörpern auf deren
 Teilkörper und deren Implementation
 in GAP,
Diplomarbeit,
Lehrstuhl D für Mathematik,
 Rheinisch Westfälische
 Technische Hochschule,
Aachen, Germany
(1992).


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

[Sch94] Schiffer, U.,
Cliffordmatrizen,
Diplomarbeit,
Lehrstuhl D für Mathematik,
 Rheinisch Westfälische
 Technische Hochschule,
Aachen, Germany
(1994).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0310051">Sco73</a>] Scott, L. L.,
Modular permutation representations,
Trans. Amer. Math. Soc.,
175
(1973),
101–121.


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

[Ser03] Seress, Á.,
Permutation Group Algorithms,
Cambridge University Press
(2003).


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

[<a href="https://www.ams.org/mathscinet-getitem?mr=0257203">Sim70</a>] Sims, C. C. (Leech, J., Ed.),
Computational methods in the study of permutation groups,
 in Computational Problems in Abstract Algebra (Proc. Conf.,
 Oxford, 1967) ,
Pergamon,
Proceedings of a Conference held at Oxford under the auspices
 of the Science Research Council, Atlas Computer Laboratory,
29,
Oxford
--> --------------------

--> maximum size reached

--> --------------------

quality91%

¤ Dauer der Verarbeitung: 0.43 Sekunden (vorverarbeitet) ¤

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.