/usr/share/gap/pkg/AtlasRep/doc/chap3.html is in gap-atlasrep 1.5.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 | <?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 (AtlasRep) - Chapter 3: The User Interface of the AtlasRep Package
</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="chap3" onload="jscontent()">
<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><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="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="chap2.html">[Previous Chapter]</a> <a href="chap4.html">[Next Chapter]</a> </div>
<p><a id="X79CC2FC07C77EB2C" name="X79CC2FC07C77EB2C"></a></p>
<div class="ChapSects"><a href="chap3.html#X79CC2FC07C77EB2C">3 <span class="Heading">The User Interface of the <strong class="pkg">AtlasRep</strong> Package
</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X87D26B13819A8209">3.1 <span class="Heading">Accessing vs. Constructing Representations</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X87E64E2B7B8A8152">3.2 <span class="Heading">Group Names Used in the <strong class="pkg">AtlasRep</strong> Package</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X7F53EDAB7992C192">3.3 <span class="Heading">Standard Generators Used in the <strong class="pkg">AtlasRep</strong> Package
</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X7E3DFE9E803D1E6E">3.4 <span class="Heading">Class Names Used in the <strong class="pkg">AtlasRep</strong> Package</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X796BB396862ABDCF">3.4-1 <span class="Heading">Definition of <strong class="pkg">ATLAS</strong> Class Names</span></a>
</span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X78166D1D7D18EFBF">3.4-2 AtlasClassNames</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X7B14A254870BA5A1">3.4-3 AtlasCharacterNames</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X86B07B4387A02B06">3.5 <span class="Heading">Accessing Data of the <strong class="pkg">AtlasRep</strong> Package</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X79DACFFA7E2D1A99">3.5-1 DisplayAtlasInfo</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X7D1CCCF8852DFF39">3.5-2 AtlasGenerators</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X801F2E657C8A79ED">3.5-3 AtlasProgram</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X83DFD8967E6BC831">3.5-4 AtlasProgramInfo</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X841478AB7CD06D44">3.5-5 OneAtlasGeneratingSetInfo</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X84C2D76482E60E42">3.5-6 AllAtlasGeneratingSetInfos</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X80AABEE783363B70">3.5-7 <span class="Heading">AtlasGroup</span></a>
</span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X7A3E460C82B3D9A3">3.5-8 <span class="Heading">AtlasSubgroup</span></a>
</span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X87AFEC90873BCDD1">3.5-9 AtlasRepInfoRecord</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X7A27E82E8480B92B">3.6 <span class="Heading"><strong class="pkg">Browse</strong> Applications Provided by
<strong class="pkg">AtlasRep</strong></span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X7F31A7CB841FE63F">3.6-1 BrowseMinimalDegrees</a></span>
<span class="ContSS"><br /><span class="nocss"> </span><a href="chap3.html#X84ED4FC182C28198">3.6-2 BrowseBibliographySporadicSimple</a></span>
</div></div>
</div>
<h3>3 <span class="Heading">The User Interface of the <strong class="pkg">AtlasRep</strong> Package
</span></h3>
<p>The <em>user interface</em> is the part of the <strong class="pkg">GAP</strong> interface that allows one to display information about the current contents of the database and to access individual data (perhaps from a remote server, see Section <a href="chap4.html#X7E1934D2780D108F"><span class="RefLink">4.3-1</span></a>). The corresponding functions are described in this chapter. See Section <a href="chap2.html#X7A9523F486EB2A04"><span class="RefLink">2.4</span></a> for some small examples how to use the functions of the interface.</p>
<p>Extensions of the <strong class="pkg">AtlasRep</strong> package are regarded as another part of the <strong class="pkg">GAP</strong> interface, they are described in Chapter <a href="chap5.html#X7B33345C7B304697"><span class="RefLink">5</span></a>. Finally, the low level part of the interface are described in Chapter <a href="chap7.html#X812769A8852CF93E"><span class="RefLink">7</span></a>.</p>
<p>For some of the examples in this chapter, the <strong class="pkg">GAP</strong> packages <strong class="pkg">CTblLib</strong> and <strong class="pkg">TomLib</strong> are needed, so we load them.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">LoadPackage( "ctbllib" );</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">LoadPackage( "tomlib" );</span>
true
</pre></div>
<p><a id="X87D26B13819A8209" name="X87D26B13819A8209"></a></p>
<h4>3.1 <span class="Heading">Accessing vs. Constructing Representations</span></h4>
<p>Note that <em>accessing</em> the data means in particular that it is <em>not</em> the aim of this package to <em>construct</em> representations from known ones. For example, if at least one permutation representation for a group <span class="SimpleMath">G</span> is stored but no matrix representation in a positive characteristic <span class="SimpleMath">p</span>, say, then <code class="func">OneAtlasGeneratingSetInfo</code> (<a href="chap3.html#X841478AB7CD06D44"><span class="RefLink">3.5-5</span></a>) returns <code class="keyw">fail</code> when it is asked for a description of an available set of matrix generators for <span class="SimpleMath">G</span> in characteristic <span class="SimpleMath">p</span>, although such a representation can be obtained by reduction modulo <span class="SimpleMath">p</span> of an integral matrix representation, which in turn can be constructed from any permutation representation.</p>
<p><a id="X87E64E2B7B8A8152" name="X87E64E2B7B8A8152"></a></p>
<h4>3.2 <span class="Heading">Group Names Used in the <strong class="pkg">AtlasRep</strong> Package</span></h4>
<p><a id="sect:groupnames"/> When you access data via the <strong class="pkg">AtlasRep</strong> package, you specify the group in question by an admissible <em>name</em>. Thus it is essential to know these names, which are called <em>the <strong class="pkg">GAP</strong> names</em> of the group in the following.</p>
<p>For a group <span class="SimpleMath">G</span>, say, whose character table is available in <strong class="pkg">GAP</strong>'s Character Table Library, the admissible names of <span class="SimpleMath">G</span> are the admissible names of this character table. If <span class="SimpleMath">G</span> is almost simple, one such name is the <code class="func">Identifier</code> (<a href="../../../doc/ref/chap71.html#X79C40EE97890202F"><span class="RefLink">Reference: Identifier (for character tables)</span></a>) value of the character table, see <code class="func">Accessing a Character Table from the Library</code> (<a href="../../../pkg/ctbllib/doc/chap2.html#X84930B2D7849E019"><span class="RefLink">CTblLib: Accessing a Character Table from the Library</span></a>). This name is usually very similar to the name used in the <strong class="pkg">ATLAS</strong> of Finite Groups <a href="chapBib.html#biBCCN85">[CCNPW85]</a>. For example, <code class="code">"M22"</code> is a <strong class="pkg">GAP</strong> name of the Mathieu group <span class="SimpleMath">M_22</span>, <code class="code">"12_1.U4(3).2_1"</code> is a <strong class="pkg">GAP</strong> name of <span class="SimpleMath">12_1.U_4(3).2_1</span>, the two names <code class="code">"S5"</code> and <code class="code">"A5.2"</code> are <strong class="pkg">GAP</strong> names of the symmetric group <span class="SimpleMath">S_5</span>, and the two names <code class="code">"F3+"</code> and <code class="code">"Fi24'"</code> are <strong class="pkg">GAP</strong> names of the simple Fischer group <span class="SimpleMath">Fi_24^'</span>.</p>
<p>When a <strong class="pkg">GAP</strong> name is required as an input of a package function, this input is case insensitive. For example, both <code class="code">"A5"</code> and <code class="code">"a5"</code> are valid arguments of <code class="func">DisplayAtlasInfo</code> (<a href="chap3.html#X79DACFFA7E2D1A99"><span class="RefLink">3.5-1</span></a>).</p>
<p>Internally, for example as part of filenames (see Section <a href="chap7.html#X7C2562A978319179"><span class="RefLink">7.6</span></a>), the package uses names that may differ from the <strong class="pkg">GAP</strong> names; these names are called <em><strong class="pkg">ATLAS</strong>-file names</em>. For example, <code class="code">"A5"</code>, <code class="code">"TE62"</code>, and <code class="code">"F24"</code> are <strong class="pkg">ATLAS</strong>-file names. Of these, only <code class="code">"A5"</code> is also a <strong class="pkg">GAP</strong> name, but the other two are not; corresponding <strong class="pkg">GAP</strong> names are <code class="code">"2E6(2)"</code> and <code class="code">"Fi24'"</code>, respectively.</p>
<p><a id="X7F53EDAB7992C192" name="X7F53EDAB7992C192"></a></p>
<h4>3.3 <span class="Heading">Standard Generators Used in the <strong class="pkg">AtlasRep</strong> Package
</span></h4>
<p>For the general definition of <em>standard generators</em> of a group, see <a href="chapBib.html#biBWil96">[Wil96]</a>.</p>
<p>Several <em>different</em> standard generators may be defined for a group, the definitions can be found at</p>
<p><span class="URL"><a href="http://brauer.maths.qmul.ac.uk/Atlas">http://brauer.maths.qmul.ac.uk/Atlas</a></span></p>
<p>When one specifies the standardization, the <span class="SimpleMath">i</span>-th set of standard generators is denoted by the number <span class="SimpleMath">i</span>. Note that when more than one set of standard generators is defined for a group, one must be careful to use <em>compatible standardization</em>. For example, the straight line programs, straight line decisions and black box programs in the database refer to a specific standardization of their inputs. That is, a straight line program for computing generators of a certain subgroup of a group <span class="SimpleMath">G</span> is defined only for a specific set of standard generators of <span class="SimpleMath">G</span>, and applying the program to matrix or permutation generators of <span class="SimpleMath">G</span> but w.r.t. a different standardization may yield unpredictable results. Therefore the results returned by the functions described in this chapter contain information about the standardizations they refer to.</p>
<p><a id="X7E3DFE9E803D1E6E" name="X7E3DFE9E803D1E6E"></a></p>
<h4>3.4 <span class="Heading">Class Names Used in the <strong class="pkg">AtlasRep</strong> Package</span></h4>
<p>For each straight line program (see <code class="func">AtlasProgram</code> (<a href="chap3.html#X801F2E657C8A79ED"><span class="RefLink">3.5-3</span></a>)) that is used to compute lists of class representatives, it is essential to describe the classes in which these elements lie. Therefore, in these cases the records returned by the function <code class="func">AtlasProgram</code> (<a href="chap3.html#X801F2E657C8A79ED"><span class="RefLink">3.5-3</span></a>) contain a component <code class="code">outputs</code> with value a list of <em>class names</em>.</p>
<p>Currently we define these class names only for simple groups and certain extensions of simple groups, see Section <a href="chap3.html#X796BB396862ABDCF"><span class="RefLink">3.4-1</span></a>. The function <code class="func">AtlasClassNames</code> (<a href="chap3.html#X78166D1D7D18EFBF"><span class="RefLink">3.4-2</span></a>) can be used to compute the list of class names from the character table in the <strong class="pkg">GAP</strong> Library.</p>
<p><a id="X796BB396862ABDCF" name="X796BB396862ABDCF"></a></p>
<h5>3.4-1 <span class="Heading">Definition of <strong class="pkg">ATLAS</strong> Class Names</span></h5>
<p>For the definition of class names of an almost simple group, we assume that the ordinary character tables of all nontrivial normal subgroups are shown in the <strong class="pkg">ATLAS</strong> of Finite Groups <a href="chapBib.html#biBCCN85">[CCNPW85]</a>.</p>
<p>Each class name is a string consisting of the element order of the class in question followed by a combination of capital letters, digits, and the characters <code class="code">'</code> and <code class="code">-</code> (starting with a capital letter). For example, <code class="code">1A</code>, <code class="code">12A1</code>, and <code class="code">3B'</code> denote the class that contains the identity element, a class of element order <span class="SimpleMath">12</span>, and a class of element order <span class="SimpleMath">3</span>, respectively.</p>
<ol>
<li><p>For the table of a <em>simple</em> group, the class names are the same as returned by the two argument version of the <strong class="pkg">GAP</strong> function <code class="func">ClassNames</code> (<a href="../../../doc/ref/chap71.html#X804CFD597C795801"><span class="RefLink">Reference: ClassNames</span></a>), cf. <a href="chapBib.html#biBCCN85">[CCNPW85, Chapter 7, Section 5]</a>: The classes are arranged w.r.t. increasing element order and for each element order w.r.t. decreasing centralizer order, the conjugacy classes that contain elements of order <span class="SimpleMath">n</span> are named <span class="SimpleMath">n</span><code class="code">A</code>, <span class="SimpleMath">n</span><code class="code">B</code>, <span class="SimpleMath">n</span><code class="code">C</code>, <span class="SimpleMath">...</span>; the alphabet used here is potentially infinite, and reads <code class="code">A</code>, <code class="code">B</code>, <code class="code">C</code>, <span class="SimpleMath">...</span>, <code class="code">Z</code>, <code class="code">A1</code>, <code class="code">B1</code>, <span class="SimpleMath">...</span>, <code class="code">A2</code>, <code class="code">B2</code>, <span class="SimpleMath">...</span>.</p>
<p>For example, the classes of the alternating group <span class="SimpleMath">A_5</span> have the names <code class="code">1A</code>, <code class="code">2A</code>, <code class="code">3A</code>, <code class="code">5A</code>, and <code class="code">5B</code>.</p>
</li>
<li><p>Next we consider the case of an <em>upward extension</em> <span class="SimpleMath">G.A</span> of a simple group <span class="SimpleMath">G</span> by a <em>cyclic</em> group of order <span class="SimpleMath">A</span>. The <strong class="pkg">ATLAS</strong> defines class names for each element <span class="SimpleMath">g</span> of <span class="SimpleMath">G.A</span> only w.r.t. the group <span class="SimpleMath">G.a</span>, say, that is generated by <span class="SimpleMath">G</span> and <span class="SimpleMath">g</span>; namely, there is a power of <span class="SimpleMath">g</span> (with the exponent coprime to the order of <span class="SimpleMath">g</span>) for which the class has a name of the same form as the class names for simple groups, and the name of the class of <span class="SimpleMath">g</span> w.r.t. <span class="SimpleMath">G.a</span> is then obtained from this name by appending a suitable number of dashes <code class="code">'</code>. So dashed class names refer exactly to those classes that are not printed in the <strong class="pkg">ATLAS</strong>.</p>
<p>For example, those classes of the symmetric group <span class="SimpleMath">S_5</span> that do not lie in <span class="SimpleMath">A_5</span> have the names <code class="code">2B</code>, <code class="code">4A</code>, and <code class="code">6A</code>. The outer classes of the group <span class="SimpleMath">L_2(8).3</span> have the names <code class="code">3B</code>, <code class="code">6A</code>, <code class="code">9D</code>, and <code class="code">3B'</code>, <code class="code">6A'</code>, <code class="code">9D'</code>. The outer elements of order <span class="SimpleMath">5</span> in the group <span class="SimpleMath">Sz(32).5</span> lie in the classes with names <code class="code">5B</code>, <code class="code">5B'</code>, <code class="code">5B''</code>, and <code class="code">5B'''</code>.</p>
<p>In the group <span class="SimpleMath">G.A</span>, the class of <span class="SimpleMath">g</span> may fuse with other classes. The name of the class of <span class="SimpleMath">g</span> in <span class="SimpleMath">G.A</span> is obtained from the names of the involved classes of <span class="SimpleMath">G.a</span> by concatenating their names after removing the element order part from all of them except the first one.</p>
<p>For example, the elements of order <span class="SimpleMath">9</span> in the group <span class="SimpleMath">L_2(27).6</span> are contained in the subgroup <span class="SimpleMath">L_2(27).3</span> but not in <span class="SimpleMath">L_2(27)</span>. In <span class="SimpleMath">L_2(27).3</span>, they lie in the classes <code class="code">9A</code>, <code class="code">9A'</code>, <code class="code">9B</code>, and <code class="code">9B'</code>; in <span class="SimpleMath">L_2(27).6</span>, these classes fuse to <code class="code">9AB</code> and <code class="code">9A'B'</code>.</p>
</li>
<li><p>Now we define class names for <em>general upward extensions</em> <span class="SimpleMath">G.A</span> of a simple group <span class="SimpleMath">G</span>. Each element <span class="SimpleMath">g</span> of such a group lies in an upward extension <span class="SimpleMath">G.a</span> by a cyclic group, and the class names w.r.t. <span class="SimpleMath">G.a</span> are already defined. The name of the class of <span class="SimpleMath">g</span> in <span class="SimpleMath">G.A</span> is obtained by concatenating the names of the classes in the orbit of <span class="SimpleMath">G.A</span> on the classes of cyclic upward extensions of <span class="SimpleMath">G</span>, after ordering the names lexicographically and removing the element order part from all of them except the first one. An <em>exception</em> is the situation where dashed and non-dashed class names appear in an orbit; in this case, the dashed names are omitted.</p>
<p>For example, the classes <code class="code">21A</code> and <code class="code">21B</code> of the group <span class="SimpleMath">U_3(5).3</span> fuse in <span class="SimpleMath">U_3(5).S_3</span> to the class <code class="code">21AB</code>, and the class <code class="code">2B</code> of <span class="SimpleMath">U_3(5).2</span> fuses with the involution classes <code class="code">2B'</code>, <code class="code">2B''</code> in the groups <span class="SimpleMath">U_3(5).2^'</span> and <span class="SimpleMath">U_3(5).2^{''}</span> to the class <code class="code">2B</code> of <span class="SimpleMath">U_3(5).S_3</span>.</p>
<p>It may happen that some names in the <code class="code">outputs</code> component of a record returned by <code class="func">AtlasProgram</code> (<a href="chap3.html#X801F2E657C8A79ED"><span class="RefLink">3.5-3</span></a>) do not uniquely determine the classes of the corresponding elements. For example, the (algebraically conjugate) classes <code class="code">39A</code> and <code class="code">39B</code> of the group <span class="SimpleMath">Co_1</span> have not been distinguished yet. In such cases, the names used contain a minus sign <code class="code">-</code>, and mean "one of the classes in the range described by the name before and the name after the minus sign"; the element order part of the name does not appear after the minus sign. So the name <code class="code">39A-B</code> for the group <span class="SimpleMath">Co_1</span> means <code class="code">39A</code> or <code class="code">39B</code>, and the name <code class="code">20A-B'''</code> for the group <span class="SimpleMath">Sz(32).5</span> means one of the classes of element order <span class="SimpleMath">20</span> in this group (these classes lie outside the simple group <span class="SimpleMath">Sz</span>).</p>
</li>
<li><p>For a <em>downward extension</em> <span class="SimpleMath">m.G.A</span> of an almost simple group <span class="SimpleMath">G.A</span> by a cyclic group of order <span class="SimpleMath">m</span>, let <span class="SimpleMath">π</span> denote the natural epimorphism from <span class="SimpleMath">m.G.A</span> onto <span class="SimpleMath">G.A</span>. Each class name of <span class="SimpleMath">m.G.A</span> has the form <code class="code">nX_0</code>, <code class="code">nX_1</code> etc., where <code class="code">nX</code> is the class name of the image under <span class="SimpleMath">π</span>, and the indices <code class="code">0</code>, <code class="code">1</code> etc. are chosen according to the position of the class in the lifting order rows for <span class="SimpleMath">G</span>, see <a href="chapBib.html#biBCCN85">[CCNPW85, Chapter 7, Section 7, and the example in Section 8]</a>).</p>
<p>For example, if <span class="SimpleMath">m = 6</span> then <code class="code">1A_1</code> and <code class="code">1A_5</code> denote the classes containing the generators of the kernel of <span class="SimpleMath">π</span>, that is, central elements of order <span class="SimpleMath">6</span>.</p>
</li>
</ol>
<p><a id="X78166D1D7D18EFBF" name="X78166D1D7D18EFBF"></a></p>
<h5>3.4-2 AtlasClassNames</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasClassNames</code>( <var class="Arg">tbl</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: a list of class names.</p>
<p>Let <var class="Arg">tbl</var> be the ordinary or modular character table of a group <span class="SimpleMath">G</span>, say, that is almost simple or a downward extension of an almost simple group and such that <var class="Arg">tbl</var> is an <strong class="pkg">ATLAS</strong> table from the <strong class="pkg">GAP</strong> Character Table Library, according to its <code class="func">InfoText</code> (<a href="../../../doc/ref/chap12.html#X871562FD7F982C12"><span class="RefLink">Reference: InfoText</span></a>) value. Then <code class="func">AtlasClassNames</code> returns the list of class names for <span class="SimpleMath">G</span>, as defined in Section <a href="chap3.html#X796BB396862ABDCF"><span class="RefLink">3.4-1</span></a>. The ordering of class names is the same as the ordering of the columns of <var class="Arg">tbl</var>.</p>
<p>(The function may work also for character tables that are not <strong class="pkg">ATLAS</strong> tables, but then clearly the class names returned are somewhat arbitrary.)</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasClassNames( CharacterTable( "L3(4).3" ) );</span>
[ "1A", "2A", "3A", "4ABC", "5A", "5B", "7A", "7B", "3B", "3B'",
"3C", "3C'", "6B", "6B'", "15A", "15A'", "15B", "15B'", "21A",
"21A'", "21B", "21B'" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasClassNames( CharacterTable( "U3(5).2" ) );</span>
[ "1A", "2A", "3A", "4A", "5A", "5B", "5CD", "6A", "7AB", "8AB",
"10A", "2B", "4B", "6D", "8C", "10B", "12B", "20A", "20B" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasClassNames( CharacterTable( "L2(27).6" ) );</span>
[ "1A", "2A", "3AB", "7ABC", "13ABC", "13DEF", "14ABC", "2B", "4A",
"26ABC", "26DEF", "28ABC", "28DEF", "3C", "3C'", "6A", "6A'",
"9AB", "9A'B'", "6B", "6B'", "12A", "12A'" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasClassNames( CharacterTable( "L3(4).3.2_2" ) );</span>
[ "1A", "2A", "3A", "4ABC", "5AB", "7A", "7B", "3B", "3C", "6B",
"15A", "15B", "21A", "21B", "2C", "4E", "6E", "8D", "14A", "14B" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasClassNames( CharacterTable( "3.A6" ) );</span>
[ "1A_0", "1A_1", "1A_2", "2A_0", "2A_1", "2A_2", "3A_0", "3B_0",
"4A_0", "4A_1", "4A_2", "5A_0", "5A_1", "5A_2", "5B_0", "5B_1",
"5B_2" ]
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasClassNames( CharacterTable( "2.A5.2" ) );</span>
[ "1A_0", "1A_1", "2A_0", "3A_0", "3A_1", "5AB_0", "5AB_1", "2B_0",
"4A_0", "4A_1", "6A_0", "6A_1" ]
</pre></div>
<p><a id="X7B14A254870BA5A1" name="X7B14A254870BA5A1"></a></p>
<h5>3.4-3 AtlasCharacterNames</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasCharacterNames</code>( <var class="Arg">tbl</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: a list of character names.</p>
<p>Let <var class="Arg">tbl</var> be the ordinary or modular character table of a simple group. <code class="func">AtlasCharacterNames</code> returns a list of strings, the <span class="SimpleMath">i</span>-th entry being the name of the <span class="SimpleMath">i</span>-th irreducible character of <var class="Arg">tbl</var>; this name consists of the degree of this character followed by distinguishing lowercase letters.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasCharacterNames( CharacterTable( "A5" ) ); </span>
[ "1a", "3a", "3b", "4a", "5a" ]
</pre></div>
<p><a id="X86B07B4387A02B06" name="X86B07B4387A02B06"></a></p>
<h4>3.5 <span class="Heading">Accessing Data of the <strong class="pkg">AtlasRep</strong> Package</span></h4>
<p>Note that the output of the examples in this section refers to a perhaps outdated table of contents; the current version of the database may contain more information than is shown here.</p>
<p><a id="X79DACFFA7E2D1A99" name="X79DACFFA7E2D1A99"></a></p>
<h5>3.5-1 DisplayAtlasInfo</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ DisplayAtlasInfo</code>( [<var class="Arg">listofnames</var>, ][<var class="Arg">std</var>, ][<var class="Arg">"contents"</var>, <var class="Arg">sources</var>, ][<var class="Arg">...</var>] )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ DisplayAtlasInfo</code>( <var class="Arg">gapname</var>[, <var class="Arg">std</var>][, <var class="Arg">...</var>] )</td><td class="tdright">( function )</td></tr></table></div>
<p>This function lists the information available via the <strong class="pkg">AtlasRep</strong> package, for the given input. Depending on whether remote access to data is enabled (see Section <a href="chap4.html#X7E1934D2780D108F"><span class="RefLink">4.3-1</span></a>), all the data provided by the <strong class="pkg">ATLAS</strong> of Group Representations or only those in the local installation are considered.</p>
<p>An interactive alternative to <code class="func">DisplayAtlasInfo</code> is the function <code class="func">BrowseAtlasInfo</code> (<span class="RefLink">???</span>), see <a href="chapBib.html#biBBrowse">[BL14]</a>.</p>
<p>Called without arguments, <code class="func">DisplayAtlasInfo</code> prints an overview what information the <strong class="pkg">ATLAS</strong> of Group Representations provides. One line is printed for each group <span class="SimpleMath">G</span>, with the following columns.</p>
<dl>
<dt><strong class="Mark"><code class="code">group</code></strong></dt>
<dd><p>the <strong class="pkg">GAP</strong> name of <span class="SimpleMath">G</span> (see Section <a href="chap3.html#X87E64E2B7B8A8152"><span class="RefLink">3.2</span></a>),</p>
</dd>
<dt><strong class="Mark"><code class="code">#</code></strong></dt>
<dd><p>the number of faithful representations stored for <span class="SimpleMath">G</span> that satisfy the additional conditions given (see below),</p>
</dd>
<dt><strong class="Mark"><code class="code">maxes</code></strong></dt>
<dd><p>the number of available straight line programs for computing generators of maximal subgroups of <span class="SimpleMath">G</span>,</p>
</dd>
<dt><strong class="Mark"><code class="code">cl</code></strong></dt>
<dd><p>a <code class="code">+</code> sign if at least one program for computing representatives of conjugacy classes of elements of <span class="SimpleMath">G</span> is stored,</p>
</dd>
<dt><strong class="Mark"><code class="code">cyc</code></strong></dt>
<dd><p>a <code class="code">+</code> sign if at least one program for computing representatives of classes of maximally cyclic subgroups of <span class="SimpleMath">G</span> is stored,</p>
</dd>
<dt><strong class="Mark"><code class="code">out</code></strong></dt>
<dd><p>descriptions of outer automorphisms of <span class="SimpleMath">G</span> for which at least one program is stored,</p>
</dd>
<dt><strong class="Mark"><code class="code">fnd</code></strong></dt>
<dd><p>a <code class="code">+</code> sign if at least one program is available for finding standard generators,</p>
</dd>
<dt><strong class="Mark"><code class="code">chk</code></strong></dt>
<dd><p>a <code class="code">+</code> sign if at least one program is available for checking whether a set of generators is a set of standard generators, and</p>
</dd>
<dt><strong class="Mark"><code class="code">prs</code></strong></dt>
<dd><p>a <code class="code">+</code> sign if at least one program is available that encodes a presentation.</p>
</dd>
</dl>
<p>(The list can be printed to the screen or can be fed into a pager, see Section <a href="chap4.html#X7DAC8E1E7A419360"><span class="RefLink">4.3-5</span></a>.)</p>
<p>Called with a list <var class="Arg">listofnames</var> of strings that are <strong class="pkg">GAP</strong> names for a group from the <strong class="pkg">ATLAS</strong> of Group Representations, <code class="func">DisplayAtlasInfo</code> prints the overview described above but restricted to the groups in this list.</p>
<p>In addition to or instead of <var class="Arg">listofnames</var>, the string <code class="code">"contents"</code> and a description <var class="Arg">sources</var> of the data may be given about which the overview is formed. See below for admissible values of <var class="Arg">sources</var>.</p>
<p>Called with a string <var class="Arg">gapname</var> that is a <strong class="pkg">GAP</strong> name for a group from the <strong class="pkg">ATLAS</strong> of Group Representations, <code class="func">DisplayAtlasInfo</code> prints an overview of the information that is available for this group. One line is printed for each faithful representation, showing the number of this representation (which can be used in calls of <code class="func">AtlasGenerators</code> (<a href="chap3.html#X7D1CCCF8852DFF39"><span class="RefLink">3.5-2</span></a>)), and a string of one of the following forms; in both cases, <var class="Arg">id</var> is a (possibly empty) string.</p>
<dl>
<dt><strong class="Mark"><code class="code">G <= Sym(<var class="Arg">n</var><var class="Arg">id</var>)</code></strong></dt>
<dd><p>denotes a permutation representation of degree <var class="Arg">n</var>, for example <code class="code">G <= Sym(40a)</code> and <code class="code">G <= Sym(40b)</code> denote two (nonequivalent) representations of degree <span class="SimpleMath">40</span>.</p>
</dd>
<dt><strong class="Mark"><code class="code">G <= GL(<var class="Arg">n</var><var class="Arg">id</var>,<var class="Arg">descr</var>)</code></strong></dt>
<dd><p>denotes a matrix representation of dimension <var class="Arg">n</var> over a coefficient ring described by <var class="Arg">descr</var>, which can be a prime power, <code class="code">ℤ</code> (denoting the ring of integers), a description of an algebraic extension field, <code class="code">ℂ</code> (denoting an unspecified algebraic extension field), or <code class="code">ℤ/<var class="Arg">m</var>ℤ</code> for an integer <var class="Arg">m</var> (denoting the ring of residues mod <var class="Arg">m</var>); for example, <code class="code">G <= GL(2a,4)</code> and <code class="code">G <= GL(2b,4)</code> denote two (nonequivalent) representations of dimension <span class="SimpleMath">2</span> over the field with four elements.</p>
</dd>
</dl>
<p>After the representations, the programs available for <var class="Arg">gapname</var> are listed.</p>
<p>The following optional arguments can be used to restrict the overviews.</p>
<dl>
<dt><strong class="Mark"><var class="Arg">std</var></strong></dt>
<dd><p>must be a positive integer or a list of positive integers; if it is given then only those representations are considered that refer to the <var class="Arg">std</var>-th set of standard generators or the <span class="SimpleMath">i</span>-th set of standard generators, for <span class="SimpleMath">i</span> in <var class="Arg">std</var> (see Section <a href="chap3.html#X7F53EDAB7992C192"><span class="RefLink">3.3</span></a>),</p>
</dd>
<dt><strong class="Mark"><code class="code">"contents"</code> and <var class="Arg">sources</var></strong></dt>
<dd><p>for a string or a list of strings <var class="Arg">sources</var>, restrict the data about which the overview is formed; if <var class="Arg">sources</var> is the string <code class="code">"public"</code> then only non-private data (see Chapter <a href="chap5.html#X7B33345C7B304697"><span class="RefLink">5</span></a>) are considered, if <var class="Arg">sources</var> is a string that denotes a private extension in the sense of a <var class="Arg">dirid</var> argument of <code class="func">AtlasOfGroupRepresentationsNotifyPrivateDirectory</code> (<a href="chap5.html#X825AF58885A48520"><span class="RefLink">5.1-1</span></a>) then only the data that belong to this private extension are considered; also a list of such strings may be given, then the union of these data is considered,</p>
</dd>
<dt><strong class="Mark"><code class="code">Identifier</code> and <var class="Arg">id</var></strong></dt>
<dd><p>restrict to representations with <code class="code">identifier</code> component in the list <var class="Arg">id</var> (note that this component is itself a list, entering this list is not admissible), or satisfying the function <var class="Arg">id</var>,</p>
</dd>
<dt><strong class="Mark"><code class="code">IsPermGroup</code> and <code class="keyw">true</code></strong></dt>
<dd><p>restrict to permutation representations,</p>
</dd>
<dt><strong class="Mark"><code class="code">NrMovedPoints</code> and <var class="Arg">n</var></strong></dt>
<dd><p>for a positive integer, a list of positive integers, or a property <var class="Arg">n</var>, restrict to permutation representations of degree equal to <var class="Arg">n</var>, or in the list <var class="Arg">n</var>, or satisfying the function <var class="Arg">n</var>,</p>
</dd>
<dt><strong class="Mark"><code class="code">NrMovedPoints</code> and the string <code class="code">"minimal"</code></strong></dt>
<dd><p>restrict to faithful permutation representations of minimal degree (if this information is available),</p>
</dd>
<dt><strong class="Mark"><code class="code">IsTransitive</code> and <code class="keyw">true</code> or <code class="keyw">false</code></strong></dt>
<dd><p>restrict to transitive or intransitive permutation representations (if this information is available),</p>
</dd>
<dt><strong class="Mark"><code class="code">IsPrimitive</code> and <code class="keyw">true</code> or <code class="keyw">false</code></strong></dt>
<dd><p>restrict to primitive or imprimitive permutation representations (if this information is available),</p>
</dd>
<dt><strong class="Mark"><code class="code">Transitivity</code> and <var class="Arg">n</var></strong></dt>
<dd><p>for a nonnegative integer, a list of nonnegative integers, or a property <var class="Arg">n</var>, restrict to permutation representations of transitivity equal to <var class="Arg">n</var>, or in the list <var class="Arg">n</var>, or satisfying the function <var class="Arg">n</var> (if this information is available),</p>
</dd>
<dt><strong class="Mark"><code class="code">RankAction</code> and <var class="Arg">n</var></strong></dt>
<dd><p>for a nonnegative integer, a list of nonnegative integers, or a property <var class="Arg">n</var>, restrict to permutation representations of rank equal to <var class="Arg">n</var>, or in the list <var class="Arg">n</var>, or satisfying the function <var class="Arg">n</var> (if this information is available),</p>
</dd>
<dt><strong class="Mark"><code class="code">IsMatrixGroup</code> and <code class="keyw">true</code></strong></dt>
<dd><p>restrict to matrix representations,</p>
</dd>
<dt><strong class="Mark"><code class="code">Characteristic</code> and <var class="Arg">p</var></strong></dt>
<dd><p>for a prime integer, a list of prime integers, or a property <var class="Arg">p</var>, restrict to matrix representations over fields of characteristic equal to <var class="Arg">p</var>, or in the list <var class="Arg">p</var>, or satisfying the function <var class="Arg">p</var> (representations over residue class rings that are not fields can be addressed by entering <code class="keyw">fail</code> as the value of <var class="Arg">p</var>),</p>
</dd>
<dt><strong class="Mark"><code class="code">Dimension</code> and <var class="Arg">n</var></strong></dt>
<dd><p>for a positive integer, a list of positive integers, or a property <var class="Arg">n</var>, restrict to matrix representations of dimension equal to <var class="Arg">n</var>, or in the list <var class="Arg">n</var>, or satisfying the function <var class="Arg">n</var>,</p>
</dd>
<dt><strong class="Mark"><code class="code">Characteristic</code>, <var class="Arg">p</var>, <code class="code">Dimension</code>,
and the string <code class="code">"minimal"</code></strong></dt>
<dd><p>for a prime integer <var class="Arg">p</var>, restrict to faithful matrix representations over fields of characteristic <var class="Arg">p</var> that have minimal dimension (if this information is available),</p>
</dd>
<dt><strong class="Mark"><code class="code">Ring</code> and <var class="Arg">R</var></strong></dt>
<dd><p>for a ring or a property <var class="Arg">R</var>, restrict to matrix representations over this ring or satisfying this function (note that the representation might be defined over a proper subring of <var class="Arg">R</var>),</p>
</dd>
<dt><strong class="Mark"><code class="code">Ring</code>, <var class="Arg">R</var>, <code class="code">Dimension</code>,
and the string <code class="code">"minimal"</code></strong></dt>
<dd><p>for a ring <var class="Arg">R</var>, restrict to faithful matrix representations over this ring that have minimal dimension (if this information is available),</p>
</dd>
<dt><strong class="Mark"><code class="code">Character</code> and <var class="Arg">chi</var></strong></dt>
<dd><p>for a class function or a list of class functions <var class="Arg">chi</var>, restrict to matrix representations with these characters (note that the underlying characteristic of the class function, see Section <a href="../../../doc/ref/chap71.html#X7F58A82F7D88000A"><span class="RefLink">Reference: UnderlyingCharacteristic</span></a>, determines the characteristic of the matrices), and</p>
</dd>
<dt><strong class="Mark"><code class="code">IsStraightLineProgram</code> and <code class="keyw">true</code></strong></dt>
<dd><p>restrict to straight line programs, straight line decisions (see Section <a href="chap6.html#X8121E9567A7137C9"><span class="RefLink">6.1</span></a>), and black box programs (see Section <a href="chap6.html#X7BE856BC785A9E8F"><span class="RefLink">6.2</span></a>).</p>
</dd>
</dl>
<p>Note that the above conditions refer only to the information that is available without accessing the representations. For example, if it is not stored in the table of contents whether a permutation representation is primitive then this representation does not match an <code class="code">IsPrimitive</code> condition in <code class="func">DisplayAtlasInfo</code>.</p>
<p>If "minimality" information is requested and no available representation matches this condition then either no minimal representation is available or the information about the minimality is missing. See <code class="func">MinimalRepresentationInfo</code> (<a href="chap6.html#X7DC66D8282B2BB7F"><span class="RefLink">6.3-1</span></a>) for checking whether the minimality information is available for the group in question. Note that in the cases where the string <code class="code">"minimal"</code> occurs as an argument, <code class="func">MinimalRepresentationInfo</code> (<a href="chap6.html#X7DC66D8282B2BB7F"><span class="RefLink">6.3-1</span></a>) is called with third argument <code class="code">"lookup"</code>; this is because the stored information was precomputed just for the groups in the <strong class="pkg">ATLAS</strong> of Group Representations, so trying to compute non-stored minimality information (using other available databases) will hardly be successful.</p>
<p>The representations are ordered as follows. Permutation representations come first (ordered according to their degrees), followed by matrix representations over finite fields (ordered first according to the field size and second according to the dimension), matrix representations over the integers, and then matrix representations over algebraic extension fields (both kinds ordered according to the dimension), the last representations are matrix representations over residue class rings (ordered first according to the modulus and second according to the dimension).</p>
<p>The maximal subgroups are ordered according to decreasing group order. For an extension <span class="SimpleMath">G.p</span> of a simple group <span class="SimpleMath">G</span> by an outer automorphism of prime order <span class="SimpleMath">p</span>, this means that <span class="SimpleMath">G</span> is the first maximal subgroup and then come the extensions of the maximal subgroups of <span class="SimpleMath">G</span> and the novelties; so the <span class="SimpleMath">n</span>-th maximal subgroup of <span class="SimpleMath">G</span> and the <span class="SimpleMath">n</span>-th maximal subgroup of <span class="SimpleMath">G.p</span> are in general not related. (This coincides with the numbering used for the <code class="func">Maxes</code> (<a href="../../../pkg/ctbllib/doc/chap3.html#X8150E63F7DBDF252"><span class="RefLink">CTblLib: Maxes</span></a>) attribute for character tables.)</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( [ "M11", "A5" ] );</span>
group | # | maxes | cl | cyc | out | fnd | chk | prs
------+----+-------+----+-----+-----+-----+-----+----
M11 | 42 | 5 | + | + | | + | + | +
A5 | 18 | 3 | | | | | + | +
</pre></div>
<p>The above output means that the <strong class="pkg">ATLAS</strong> of Group Representations contains <span class="SimpleMath">42</span> representations of the Mathieu group <span class="SimpleMath">M_11</span>, straight line programs for computing generators of representatives of all five classes of maximal subgroups, for computing representatives of the conjugacy classes of elements and of generators of maximally cyclic subgroups, contains no straight line program for applying outer automorphisms (well, in fact <span class="SimpleMath">M_11</span> admits no nontrivial outer automorphism), and contains straight line decisions that check a set of generators or a set of group elements for being a set of standard generators. Analogously, <span class="SimpleMath">18</span> representations of the alternating group <span class="SimpleMath">A_5</span> are available, straight line programs for computing generators of representatives of all three classes of maximal subgroups, and no straight line programs for computing representatives of the conjugacy classes of elements, of generators of maximally cyclic subgroups, and no for computing images under outer automorphisms; straight line decisions for checking the standardization of generators or group elements are available.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( "A5", IsPermGroup, true );</span>
Representations for G = A5: (all refer to std. generators 1)
---------------------------
1: G <= Sym(5) 3-trans., on cosets of A4 (1st max.)
2: G <= Sym(6) 2-trans., on cosets of D10 (2nd max.)
3: G <= Sym(10) rank 3, on cosets of S3 (3rd max.)
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( "A5", NrMovedPoints, [ 4 .. 9 ] );</span>
Representations for G = A5: (all refer to std. generators 1)
---------------------------
1: G <= Sym(5) 3-trans., on cosets of A4 (1st max.)
2: G <= Sym(6) 2-trans., on cosets of D10 (2nd max.)
</pre></div>
<p>The first three representations stored for <span class="SimpleMath">A_5</span> are (in fact primitive) permutation representations.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( "A5", Dimension, [ 1 .. 3 ] );</span>
Representations for G = A5: (all refer to std. generators 1)
---------------------------
8: G <= GL(2a,4)
9: G <= GL(2b,4)
10: G <= GL(3,5)
12: G <= GL(3a,9)
13: G <= GL(3b,9)
17: G <= GL(3a,Field([Sqrt(5)]))
18: G <= GL(3b,Field([Sqrt(5)]))
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( "A5", Characteristic, 0 );</span>
Representations for G = A5: (all refer to std. generators 1)
---------------------------
14: G <= GL(4,Z)
15: G <= GL(5,Z)
16: G <= GL(6,Z)
17: G <= GL(3a,Field([Sqrt(5)]))
18: G <= GL(3b,Field([Sqrt(5)]))
</pre></div>
<p>The representations with number between <span class="SimpleMath">4</span> and <span class="SimpleMath">13</span> are (in fact irreducible) matrix representations over various finite fields, those with numbers <span class="SimpleMath">14</span> to <span class="SimpleMath">16</span> are integral matrix representations, and the last two are matrix representations over the field generated by <span class="SimpleMath">sqrt{5}</span> over the rational number field.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( "A5", Identifier, "a" );</span>
Representations for G = A5: (all refer to std. generators 1)
---------------------------
4: G <= GL(4a,2)
8: G <= GL(2a,4)
12: G <= GL(3a,9)
17: G <= GL(3a,Field([Sqrt(5)]))
</pre></div>
<p>Each of the representations with the numbers <span class="SimpleMath">4, 8, 12</span>, and <span class="SimpleMath">17</span> is labeled with the distinguishing letter <code class="code">a</code>.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( "A5", NrMovedPoints, IsPrimeInt );</span>
Representations for G = A5: (all refer to std. generators 1)
---------------------------
1: G <= Sym(5) 3-trans., on cosets of A4 (1st max.)
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( "A5", Characteristic, IsOddInt );</span>
Representations for G = A5: (all refer to std. generators 1)
---------------------------
6: G <= GL(4,3)
7: G <= GL(6,3)
10: G <= GL(3,5)
11: G <= GL(5,5)
12: G <= GL(3a,9)
13: G <= GL(3b,9)
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( "A5", Dimension, IsPrimeInt );</span>
Representations for G = A5: (all refer to std. generators 1)
---------------------------
8: G <= GL(2a,4)
9: G <= GL(2b,4)
10: G <= GL(3,5)
11: G <= GL(5,5)
12: G <= GL(3a,9)
13: G <= GL(3b,9)
15: G <= GL(5,Z)
17: G <= GL(3a,Field([Sqrt(5)]))
18: G <= GL(3b,Field([Sqrt(5)]))
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( "A5", Ring, IsFinite and IsPrimeField );</span>
Representations for G = A5: (all refer to std. generators 1)
---------------------------
4: G <= GL(4a,2)
5: G <= GL(4b,2)
6: G <= GL(4,3)
7: G <= GL(6,3)
10: G <= GL(3,5)
11: G <= GL(5,5)
</pre></div>
<p>The above examples show how the output can be restricted using a property (a unary function that returns either <code class="keyw">true</code> or <code class="keyw">false</code>) that follows <code class="func">NrMovedPoints</code> (<a href="../../../doc/ref/chap42.html#X85E7B1E28430F49E"><span class="RefLink">Reference: NrMovedPoints (for a permutation)</span></a>), <code class="func">Characteristic</code> (<a href="../../../doc/ref/chap31.html#X81278E53800BF64D"><span class="RefLink">Reference: Characteristic</span></a>), <code class="func">Dimension</code> (<a href="../../../doc/ref/chap57.html#X7E6926C6850E7C4E"><span class="RefLink">Reference: Dimension</span></a>), or <code class="func">Ring</code> (<a href="../../../doc/ref/chap56.html#X820B172A860A5B1A"><span class="RefLink">Reference: Ring</span></a>) in the argument list of <code class="func">DisplayAtlasInfo</code>.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">DisplayAtlasInfo( "A5", IsStraightLineProgram, true );</span>
Programs for G = A5: (all refer to std. generators 1)
--------------------
presentation
std. gen. checker
maxes (all 3):
1: A4
2: D10
3: S3
</pre></div>
<p>Straight line programs are available for computing generators of representatives of the three classes of maximal subgroups of <span class="SimpleMath">A_5</span>, and a straight line decision for checking whether given generators are in fact standard generators is available as well as a presentation in terms of standard generators, see <code class="func">AtlasProgram</code> (<a href="chap3.html#X801F2E657C8A79ED"><span class="RefLink">3.5-3</span></a>).</p>
<p><a id="X7D1CCCF8852DFF39" name="X7D1CCCF8852DFF39"></a></p>
<h5>3.5-2 AtlasGenerators</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasGenerators</code>( <var class="Arg">gapname</var>, <var class="Arg">repnr</var>[, <var class="Arg">maxnr</var>] )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasGenerators</code>( <var class="Arg">identifier</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: a record containing generators for a representation, or <code class="keyw">fail</code>.</p>
<p>In the first form, <var class="Arg">gapname</var> must be a string denoting a <strong class="pkg">GAP</strong> name (see Section <a href="chap3.html#X87E64E2B7B8A8152"><span class="RefLink">3.2</span></a>) of a group, and <var class="Arg">repnr</var> a positive integer. If the <strong class="pkg">ATLAS</strong> of Group Representations contains at least <var class="Arg">repnr</var> representations for the group with <strong class="pkg">GAP</strong> name <var class="Arg">gapname</var> then <code class="func">AtlasGenerators</code>, when called with <var class="Arg">gapname</var> and <var class="Arg">repnr</var>, returns an immutable record describing the <var class="Arg">repnr</var>-th representation; otherwise <code class="keyw">fail</code> is returned. If a third argument <var class="Arg">maxnr</var>, a positive integer, is given then an immutable record describing the restriction of the <var class="Arg">repnr</var>-th representation to the <var class="Arg">maxnr</var>-th maximal subgroup is returned.</p>
<p>The result record has at least the following components.</p>
<dl>
<dt><strong class="Mark"><code class="code">generators</code></strong></dt>
<dd><p>a list of generators for the group,</p>
</dd>
<dt><strong class="Mark"><code class="code">groupname</code></strong></dt>
<dd><p>the <strong class="pkg">GAP</strong> name of the group (see Section <a href="chap3.html#X87E64E2B7B8A8152"><span class="RefLink">3.2</span></a>),</p>
</dd>
<dt><strong class="Mark"><code class="code">identifier</code></strong></dt>
<dd><p>a <strong class="pkg">GAP</strong> object (a list of filenames plus additional information) that uniquely determines the representation; the value can be used as <var class="Arg">identifier</var> argument of <code class="func">AtlasGenerators</code>.</p>
</dd>
<dt><strong class="Mark"><code class="code">repnr</code></strong></dt>
<dd><p>the number of the representation in the current session, equal to the argument <var class="Arg">repnr</var> if this is given.</p>
</dd>
<dt><strong class="Mark"><code class="code">standardization</code></strong></dt>
<dd><p>the positive integer denoting the underlying standard generators,</p>
</dd>
</dl>
<p>Additionally, the group order may be stored in the component <code class="code">size</code>, and describing components may be available that depend on the data type of the representation: For permutation representations, these are <code class="code">p</code> for the number of moved points, <code class="code">id</code> for the distinguishing string as described for <code class="func">DisplayAtlasInfo</code> (<a href="chap3.html#X79DACFFA7E2D1A99"><span class="RefLink">3.5-1</span></a>), and information about primitivity, point stabilizers etc. if available; for matrix representations, these are <code class="code">dim</code> for the dimension of the matrices, <code class="code">ring</code> (if known) for the ring generated by the matrix entries, <code class="code">id</code> for the distinguishing string, and information about the character if available.</p>
<p>It should be noted that the number <var class="Arg">repnr</var> refers to the number shown by <code class="func">DisplayAtlasInfo</code> (<a href="chap3.html#X79DACFFA7E2D1A99"><span class="RefLink">3.5-1</span></a>) <em>in the current session</em>; it may be that after the addition of new representations, <var class="Arg">repnr</var> refers to another representation.</p>
<p>The alternative form of <code class="func">AtlasGenerators</code>, with only argument <var class="Arg">identifier</var>, can be used to fetch the result record with <code class="code">identifier</code> value equal to <var class="Arg">identifier</var>. The purpose of this variant is to access the <em>same</em> representation also in <em>different</em> <strong class="pkg">GAP</strong> sessions.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">gens1:= AtlasGenerators( "A5", 1 );</span>
rec( generators := [ (1,2)(3,4), (1,3,5) ], groupname := "A5",
id := "",
identifier := [ "A5", [ "A5G1-p5B0.m1", "A5G1-p5B0.m2" ], 1, 5 ],
isPrimitive := true, maxnr := 1, p := 5, rankAction := 2,
repname := "A5G1-p5B0", repnr := 1, size := 60, stabilizer := "A4",
standardization := 1, transitivity := 3, type := "perm" )
<span class="GAPprompt">gap></span> <span class="GAPinput">gens8:= AtlasGenerators( "A5", 8 );</span>
rec( dim := 2,
generators := [ [ [ Z(2)^0, 0*Z(2) ], [ Z(2^2), Z(2)^0 ] ],
[ [ 0*Z(2), Z(2)^0 ], [ Z(2)^0, Z(2)^0 ] ] ], groupname := "A5",
id := "a",
identifier := [ "A5", [ "A5G1-f4r2aB0.m1", "A5G1-f4r2aB0.m2" ], 1,
4 ], repname := "A5G1-f4r2aB0", repnr := 8, ring := GF(2^2),
size := 60, standardization := 1, type := "matff" )
<span class="GAPprompt">gap></span> <span class="GAPinput">gens17:= AtlasGenerators( "A5", 17 );</span>
rec( dim := 3,
generators :=
[ [ [ -1, 0, 0 ], [ 0, -1, 0 ], [ -E(5)-E(5)^4, -E(5)-E(5)^4, 1 ]
], [ [ 0, 1, 0 ], [ 0, 0, 1 ], [ 1, 0, 0 ] ] ],
groupname := "A5", id := "a",
identifier := [ "A5", "A5G1-Ar3aB0.g", 1, 3 ],
repname := "A5G1-Ar3aB0", repnr := 17, ring := NF(5,[ 1, 4 ]),
size := 60, standardization := 1, type := "matalg" )
</pre></div>
<p>Each of the above pairs of elements generates a group isomorphic to <span class="SimpleMath">A_5</span>.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">gens1max2:= AtlasGenerators( "A5", 1, 2 );</span>
rec( generators := [ (1,2)(3,4), (2,3)(4,5) ], groupname := "D10",
identifier := [ "A5", [ "A5G1-p5B0.m1", "A5G1-p5B0.m2" ], 1, 5, 2 ],
repnr := 1, size := 10, standardization := 1 )
<span class="GAPprompt">gap></span> <span class="GAPinput">id:= gens1max2.identifier;;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">gens1max2 = AtlasGenerators( id );</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">max2:= Group( gens1max2.generators );;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">Size( max2 );</span>
10
<span class="GAPprompt">gap></span> <span class="GAPinput">IdGroup( max2 ) = IdGroup( DihedralGroup( 10 ) );</span>
true
</pre></div>
<p>The elements stored in <code class="code">gens1max2.generators</code> describe the restriction of the first representation of <span class="SimpleMath">A_5</span> to a group in the second class of maximal subgroups of <span class="SimpleMath">A_5</span> according to the list in the <strong class="pkg">ATLAS</strong> of Finite Groups <a href="chapBib.html#biBCCN85">[CCNPW85]</a>; this subgroup is isomorphic to the dihedral group <span class="SimpleMath">D_10</span>.</p>
<p><a id="X801F2E657C8A79ED" name="X801F2E657C8A79ED"></a></p>
<h5>3.5-3 AtlasProgram</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasProgram</code>( <var class="Arg">gapname</var>[, <var class="Arg">std</var>], <var class="Arg">...</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasProgram</code>( <var class="Arg">identifier</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: a record containing a program, or <code class="keyw">fail</code>.</p>
<p>In the first form, <var class="Arg">gapname</var> must be a string denoting a <strong class="pkg">GAP</strong> name (see Section <a href="chap3.html#X87E64E2B7B8A8152"><span class="RefLink">3.2</span></a>) of a group <span class="SimpleMath">G</span>, say. If the <strong class="pkg">ATLAS</strong> of Group Representations contains a straight line program (see Section <a href="../../../doc/ref/chap37.html#X7DC99E4284093FBB"><span class="RefLink">Reference: Straight Line Programs</span></a>) or straight line decision (see Section <a href="chap6.html#X8121E9567A7137C9"><span class="RefLink">6.1</span></a>) or black box program (see Section <a href="chap6.html#X7BE856BC785A9E8F"><span class="RefLink">6.2</span></a>) as described by the remaining arguments (see below) then <code class="func">AtlasProgram</code> returns an immutable record containing this program. Otherwise <code class="keyw">fail</code> is returned.</p>
<p>If the optional argument <var class="Arg">std</var> is given, only those straight line programs/decisions are considered that take generators from the <var class="Arg">std</var>-th set of standard generators of <span class="SimpleMath">G</span> as input, see Section <a href="chap3.html#X7F53EDAB7992C192"><span class="RefLink">3.3</span></a>.</p>
<p>The result record has the following components.</p>
<dl>
<dt><strong class="Mark"><code class="code">program</code></strong></dt>
<dd><p>the required straight line program/decision, or black box program,</p>
</dd>
<dt><strong class="Mark"><code class="code">standardization</code></strong></dt>
<dd><p>the positive integer denoting the underlying standard generators of <span class="SimpleMath">G</span>,</p>
</dd>
<dt><strong class="Mark"><code class="code">identifier</code></strong></dt>
<dd><p>a <strong class="pkg">GAP</strong> object (a list of filenames plus additional information) that uniquely determines the program; the value can be used as <var class="Arg">identifier</var> argument of <code class="func">AtlasProgram</code> (see below).</p>
</dd>
</dl>
<p>In the first form, the last arguments must be as follows.</p>
<dl>
<dt><strong class="Mark">(the string <code class="code">"maxes"</code> and) a positive integer <var class="Arg">maxnr</var>
</strong></dt>
<dd><p>the required program computes generators of the <var class="Arg">maxnr</var>-th maximal subgroup of the group with <strong class="pkg">GAP</strong> name <var class="Arg">gapname</var>.</p>
<p>In this case, the result record of <code class="func">AtlasProgram</code> also may contain a component <code class="code">size</code>, whose value is the order of the maximal subgroup in question.</p>
</dd>
<dt><strong class="Mark">one of the strings <code class="code">"classes"</code> or <code class="code">"cyclic"</code></strong></dt>
<dd><p>the required program computes representatives of conjugacy classes of elements or representatives of generators of maximally cyclic subgroups of <span class="SimpleMath">G</span>, respectively.</p>
<p>See <a href="chapBib.html#biBBSW01">[BSWW01]</a> and <a href="chapBib.html#biBSWW00">[SWW00]</a> for the background concerning these straight line programs. In these cases, the result record of <code class="func">AtlasProgram</code> also contains a component <code class="code">outputs</code>, whose value is a list of class names of the outputs, as described in Section <a href="chap3.html#X7E3DFE9E803D1E6E"><span class="RefLink">3.4</span></a>.</p>
</dd>
<dt><strong class="Mark">the strings <code class="code">"automorphism"</code> and <var class="Arg">autname</var></strong></dt>
<dd><p>the required program computes images of standard generators under the outer automorphism of <span class="SimpleMath">G</span> that is given by this string.</p>
<p>Note that a value <code class="code">"2"</code> of <var class="Arg">autname</var> means that the square of the automorphism is an inner automorphism of <span class="SimpleMath">G</span> (not necessarily the identity mapping) but the automorphism itself is not.</p>
</dd>
<dt><strong class="Mark">the string <code class="code">"check"</code></strong></dt>
<dd><p>the required result is a straight line decision that takes a list of generators for <span class="SimpleMath">G</span> and returns <code class="keyw">true</code> if these generators are standard generators of <span class="SimpleMath">G</span> w.r.t. the standardization <var class="Arg">std</var>, and <code class="keyw">false</code> otherwise.</p>
</dd>
<dt><strong class="Mark">the string <code class="code">"presentation"</code></strong></dt>
<dd><p>the required result is a straight line decision that takes a list of group elements and returns <code class="keyw">true</code> if these elements are standard generators of <span class="SimpleMath">G</span> w.r.t. the standardization <var class="Arg">std</var>, and <code class="keyw">false</code> otherwise.</p>
<p>See <code class="func">StraightLineProgramFromStraightLineDecision</code> (<a href="chap6.html#X7EA613C57DDC67D5"><span class="RefLink">6.1-9</span></a>) for an example how to derive defining relators for <span class="SimpleMath">G</span> in terms of the standard generators from such a straight line decision.</p>
</dd>
<dt><strong class="Mark">the string <code class="code">"find"</code></strong></dt>
<dd><p>the required result is a black box program that takes <span class="SimpleMath">G</span> and returns a list of standard generators of <span class="SimpleMath">G</span>, w.r.t. the standardization <var class="Arg">std</var>.</p>
</dd>
<dt><strong class="Mark">the string <code class="code">"restandardize"</code> and an integer <var class="Arg">std2</var></strong></dt>
<dd><p>the required result is a straight line program that computes standard generators of <span class="SimpleMath">G</span> w.r.t. the <var class="Arg">std2</var>-th set of standard generators of <span class="SimpleMath">G</span>; in this case, the argument <var class="Arg">std</var> must be given.</p>
</dd>
<dt><strong class="Mark">the strings <code class="code">"other"</code> and <var class="Arg">descr</var></strong></dt>
<dd><p>the required program is described by <var class="Arg">descr</var>.</p>
</dd>
</dl>
<p>The second form of <code class="func">AtlasProgram</code>, with only argument the list <var class="Arg">identifier</var>, can be used to fetch the result record with <code class="code">identifier</code> value equal to <var class="Arg">identifier</var>.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">prog:= AtlasProgram( "A5", 2 );</span>
rec( groupname := "A5", identifier := [ "A5", "A5G1-max2W1", 1 ],
program := <straight line program>, size := 10,
standardization := 1, subgroupname := "D10" )
<span class="GAPprompt">gap></span> <span class="GAPinput">StringOfResultOfStraightLineProgram( prog.program, [ "a", "b" ] );</span>
"[ a, bbab ]"
<span class="GAPprompt">gap></span> <span class="GAPinput">gens1:= AtlasGenerators( "A5", 1 );</span>
rec( generators := [ (1,2)(3,4), (1,3,5) ], groupname := "A5",
id := "",
identifier := [ "A5", [ "A5G1-p5B0.m1", "A5G1-p5B0.m2" ], 1, 5 ],
isPrimitive := true, maxnr := 1, p := 5, rankAction := 2,
repname := "A5G1-p5B0", repnr := 1, size := 60, stabilizer := "A4",
standardization := 1, transitivity := 3, type := "perm" )
<span class="GAPprompt">gap></span> <span class="GAPinput">maxgens:= ResultOfStraightLineProgram( prog.program, gens1.generators );</span>
[ (1,2)(3,4), (2,3)(4,5) ]
<span class="GAPprompt">gap></span> <span class="GAPinput">maxgens = gens1max2.generators;</span>
true
</pre></div>
<p>The above example shows that for restricting representations given by standard generators to a maximal subgroup of <span class="SimpleMath">A_5</span>, we can also fetch and apply the appropriate straight line program. Such a program (see <a href="../../../doc/ref/chap37.html#X7DC99E4284093FBB"><span class="RefLink">Reference: Straight Line Programs</span></a>) takes standard generators of a group --in this example <span class="SimpleMath">A_5</span>-- as its input, and returns a list of elements in this group --in this example generators of the <span class="SimpleMath">D_10</span> subgroup we had met above-- which are computed essentially by evaluating structured words in terms of the standard generators.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">prog:= AtlasProgram( "J1", "cyclic" );</span>
rec( groupname := "J1", identifier := [ "J1", "J1G1-cycW1", 1 ],
outputs := [ "6A", "7A", "10B", "11A", "15B", "19A" ],
program := <straight line program>, standardization := 1 )
<span class="GAPprompt">gap></span> <span class="GAPinput">gens:= GeneratorsOfGroup( FreeGroup( "x", "y" ) );;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">ResultOfStraightLineProgram( prog.program, gens );</span>
[ (x*y)^2*((y*x)^2*y^2*x)^2*y^2, x*y, (x*(y*x*y)^2)^2*y,
(x*y*x*(y*x*y)^3*x*y^2)^2*x*y*x*(y*x*y)^2*y, x*y*x*(y*x*y)^2*y,
(x*y)^2*y ]
</pre></div>
<p>The above example shows how to fetch and use straight line programs for computing generators of representatives of maximally cyclic subgroups of a given group.</p>
<p><a id="X83DFD8967E6BC831" name="X83DFD8967E6BC831"></a></p>
<h5>3.5-4 AtlasProgramInfo</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasProgramInfo</code>( <var class="Arg">gapname</var>[, <var class="Arg">std</var>][, <var class="Arg">"contents"</var>, <var class="Arg">sources</var>][, <var class="Arg">...</var>] )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: a record describing a program, or <code class="keyw">fail</code>.</p>
<p><code class="func">AtlasProgramInfo</code> takes the same arguments as <code class="func">AtlasProgram</code> (<a href="chap3.html#X801F2E657C8A79ED"><span class="RefLink">3.5-3</span></a>), and returns a similar result. The only difference is that the records returned by <code class="func">AtlasProgramInfo</code> have no components <code class="code">program</code> and <code class="code">outputs</code>. The idea is that one can use <code class="func">AtlasProgramInfo</code> for testing whether the program in question is available at all, but without transferring it from a remote server. The <code class="code">identifier</code> component of the result of <code class="func">AtlasProgramInfo</code> can then be used to fetch the program with <code class="func">AtlasProgram</code> (<a href="chap3.html#X801F2E657C8A79ED"><span class="RefLink">3.5-3</span></a>).</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasProgramInfo( "J1", "cyclic" );</span>
rec( groupname := "J1", identifier := [ "J1", "J1G1-cycW1", 1 ],
standardization := 1 )
</pre></div>
<p><a id="X841478AB7CD06D44" name="X841478AB7CD06D44"></a></p>
<h5>3.5-5 OneAtlasGeneratingSetInfo</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ OneAtlasGeneratingSetInfo</code>( [<var class="Arg">gapname</var>, ][<var class="Arg">std</var>, ][<var class="Arg">...</var>] )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: a record describing a representation that satisfies the conditions, or <code class="keyw">fail</code>.</p>
<p>Let <var class="Arg">gapname</var> be a string denoting a <strong class="pkg">GAP</strong> name (see Section <a href="chap3.html#X87E64E2B7B8A8152"><span class="RefLink">3.2</span></a>) of a group <span class="SimpleMath">G</span>, say. If the <strong class="pkg">ATLAS</strong> of Group Representations contains at least one representation for <span class="SimpleMath">G</span> with the required properties then <code class="func">OneAtlasGeneratingSetInfo</code> returns a record <var class="Arg">r</var> whose components are the same as those of the records returned by <code class="func">AtlasGenerators</code> (<a href="chap3.html#X7D1CCCF8852DFF39"><span class="RefLink">3.5-2</span></a>), except that the component <code class="code">generators</code> is not contained; the component <code class="code">identifier</code> of <var class="Arg">r</var> can be used as input for <code class="func">AtlasGenerators</code> (<a href="chap3.html#X7D1CCCF8852DFF39"><span class="RefLink">3.5-2</span></a>) in order to fetch the generators. If no representation satisfying the given conditions is available then <code class="keyw">fail</code> is returned.</p>
<p>If the argument <var class="Arg">std</var> is given then it must be a positive integer or a list of positive integers, denoting the sets of standard generators w.r.t. which the representation shall be given (see Section <a href="chap3.html#X7F53EDAB7992C192"><span class="RefLink">3.3</span></a>).</p>
<p>The argument <var class="Arg">gapname</var> can be missing (then all available groups are considered), or a list of group names can be given instead.</p>
<p>Further restrictions can be entered as arguments, with the same meaning as described for <code class="func">DisplayAtlasInfo</code> (<a href="chap3.html#X79DACFFA7E2D1A99"><span class="RefLink">3.5-1</span></a>). The result of <code class="func">OneAtlasGeneratingSetInfo</code> describes the first generating set for <span class="SimpleMath">G</span> that matches the restrictions, in the ordering shown by <code class="func">DisplayAtlasInfo</code> (<a href="chap3.html#X79DACFFA7E2D1A99"><span class="RefLink">3.5-1</span></a>).</p>
<p>Note that even in the case that the user parameter "remote" has the value <code class="keyw">true</code> (see Section <a href="chap4.html#X7E1934D2780D108F"><span class="RefLink">4.3-1</span></a>), <code class="func">OneAtlasGeneratingSetInfo</code> does <em>not</em> attempt to <em>transfer</em> remote data files, just the table of contents is evaluated. So this function (as well as <code class="func">AllAtlasGeneratingSetInfos</code> (<a href="chap3.html#X84C2D76482E60E42"><span class="RefLink">3.5-6</span></a>)) can be used to check for the availability of certain representations, and afterwards one can call <code class="func">AtlasGenerators</code> (<a href="chap3.html#X7D1CCCF8852DFF39"><span class="RefLink">3.5-2</span></a>) for those representations one wants to work with.</p>
<p>In the following example, we try to access information about permutation representations for the alternating group <span class="SimpleMath">A_5</span>.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">info:= OneAtlasGeneratingSetInfo( "A5" );</span>
rec( groupname := "A5", id := "",
identifier := [ "A5", [ "A5G1-p5B0.m1", "A5G1-p5B0.m2" ], 1, 5 ],
isPrimitive := true, maxnr := 1, p := 5, rankAction := 2,
repname := "A5G1-p5B0", repnr := 1, size := 60, stabilizer := "A4",
standardization := 1, transitivity := 3, type := "perm" )
<span class="GAPprompt">gap></span> <span class="GAPinput">gens:= AtlasGenerators( info.identifier );</span>
rec( generators := [ (1,2)(3,4), (1,3,5) ], groupname := "A5",
id := "",
identifier := [ "A5", [ "A5G1-p5B0.m1", "A5G1-p5B0.m2" ], 1, 5 ],
isPrimitive := true, maxnr := 1, p := 5, rankAction := 2,
repname := "A5G1-p5B0", repnr := 1, size := 60, stabilizer := "A4",
standardization := 1, transitivity := 3, type := "perm" )
<span class="GAPprompt">gap></span> <span class="GAPinput">info = OneAtlasGeneratingSetInfo( "A5", IsPermGroup, true );</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">info = OneAtlasGeneratingSetInfo( "A5", NrMovedPoints, "minimal" );</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">info = OneAtlasGeneratingSetInfo( "A5", NrMovedPoints, [ 1 .. 10 ] );</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">OneAtlasGeneratingSetInfo( "A5", NrMovedPoints, 20 );</span>
fail
</pre></div>
<p>Note that a permutation representation of degree <span class="SimpleMath">20</span> could be obtained by taking twice the primitive representation on <span class="SimpleMath">10</span> points; however, the <strong class="pkg">ATLAS</strong> of Group Representations does not store this imprimitive representation (cf. Section <a href="chap3.html#X87D26B13819A8209"><span class="RefLink">3.1</span></a>).</p>
<p>We continue this example a little. Next we access matrix representations of <span class="SimpleMath">A_5</span>.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">info:= OneAtlasGeneratingSetInfo( "A5", IsMatrixGroup, true );</span>
rec( dim := 4, groupname := "A5", id := "a",
identifier := [ "A5", [ "A5G1-f2r4aB0.m1", "A5G1-f2r4aB0.m2" ], 1,
2 ], repname := "A5G1-f2r4aB0", repnr := 4, ring := GF(2),
size := 60, standardization := 1, type := "matff" )
<span class="GAPprompt">gap></span> <span class="GAPinput">gens:= AtlasGenerators( info.identifier );</span>
rec( dim := 4,
generators := [ <an immutable 4x4 matrix over GF2>,
<an immutable 4x4 matrix over GF2> ], groupname := "A5",
id := "a",
identifier := [ "A5", [ "A5G1-f2r4aB0.m1", "A5G1-f2r4aB0.m2" ], 1,
2 ], repname := "A5G1-f2r4aB0", repnr := 4, ring := GF(2),
size := 60, standardization := 1, type := "matff" )
<span class="GAPprompt">gap></span> <span class="GAPinput">info = OneAtlasGeneratingSetInfo( "A5", Dimension, 4 );</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">info = OneAtlasGeneratingSetInfo( "A5", Characteristic, 2 );</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">info = OneAtlasGeneratingSetInfo( "A5", Ring, GF(2) );</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">OneAtlasGeneratingSetInfo( "A5", Characteristic, [2,5], Dimension, 2 );</span>
rec( dim := 2, groupname := "A5", id := "a",
identifier := [ "A5", [ "A5G1-f4r2aB0.m1", "A5G1-f4r2aB0.m2" ], 1,
4 ], repname := "A5G1-f4r2aB0", repnr := 8, ring := GF(2^2),
size := 60, standardization := 1, type := "matff" )
<span class="GAPprompt">gap></span> <span class="GAPinput">OneAtlasGeneratingSetInfo( "A5", Characteristic, [2,5], Dimension, 1 );</span>
fail
<span class="GAPprompt">gap></span> <span class="GAPinput">info:= OneAtlasGeneratingSetInfo( "A5", Characteristic, 0, Dimension, 4 );</span>
rec( dim := 4, groupname := "A5", id := "",
identifier := [ "A5", "A5G1-Zr4B0.g", 1, 4 ],
repname := "A5G1-Zr4B0", repnr := 14, ring := Integers, size := 60,
standardization := 1, type := "matint" )
<span class="GAPprompt">gap></span> <span class="GAPinput">gens:= AtlasGenerators( info.identifier );</span>
rec( dim := 4,
generators :=
[
[ [ 1, 0, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 1, 0, 0 ],
[ -1, -1, -1, -1 ] ],
[ [ 0, 1, 0, 0 ], [ 0, 0, 0, 1 ], [ 0, 0, 1, 0 ],
[ 1, 0, 0, 0 ] ] ], groupname := "A5", id := "",
identifier := [ "A5", "A5G1-Zr4B0.g", 1, 4 ],
repname := "A5G1-Zr4B0", repnr := 14, ring := Integers, size := 60,
standardization := 1, type := "matint" )
<span class="GAPprompt">gap></span> <span class="GAPinput">info = OneAtlasGeneratingSetInfo( "A5", Ring, Integers );</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">info = OneAtlasGeneratingSetInfo( "A5", Ring, CF(37) );</span>
true
<span class="GAPprompt">gap></span> <span class="GAPinput">OneAtlasGeneratingSetInfo( "A5", Ring, Integers mod 77 );</span>
fail
<span class="GAPprompt">gap></span> <span class="GAPinput">info:= OneAtlasGeneratingSetInfo( "A5", Ring, CF(5), Dimension, 3 );</span>
rec( dim := 3, groupname := "A5", id := "a",
identifier := [ "A5", "A5G1-Ar3aB0.g", 1, 3 ],
repname := "A5G1-Ar3aB0", repnr := 17, ring := NF(5,[ 1, 4 ]),
size := 60, standardization := 1, type := "matalg" )
<span class="GAPprompt">gap></span> <span class="GAPinput">gens:= AtlasGenerators( info.identifier );</span>
rec( dim := 3,
generators :=
[ [ [ -1, 0, 0 ], [ 0, -1, 0 ], [ -E(5)-E(5)^4, -E(5)-E(5)^4, 1 ]
], [ [ 0, 1, 0 ], [ 0, 0, 1 ], [ 1, 0, 0 ] ] ],
groupname := "A5", id := "a",
identifier := [ "A5", "A5G1-Ar3aB0.g", 1, 3 ],
repname := "A5G1-Ar3aB0", repnr := 17, ring := NF(5,[ 1, 4 ]),
size := 60, standardization := 1, type := "matalg" )
<span class="GAPprompt">gap></span> <span class="GAPinput">OneAtlasGeneratingSetInfo( "A5", Ring, GF(17) );</span>
fail
</pre></div>
<p><a id="X84C2D76482E60E42" name="X84C2D76482E60E42"></a></p>
<h5>3.5-6 AllAtlasGeneratingSetInfos</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AllAtlasGeneratingSetInfos</code>( [<var class="Arg">gapname</var>, ][<var class="Arg">std</var>, ][<var class="Arg">...</var>] )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the list of all records describing representations that satisfy the conditions.</p>
<p><code class="func">AllAtlasGeneratingSetInfos</code> is similar to <code class="func">OneAtlasGeneratingSetInfo</code> (<a href="chap3.html#X841478AB7CD06D44"><span class="RefLink">3.5-5</span></a>). The difference is that the list of <em>all</em> records describing the available representations with the given properties is returned instead of just one such component. In particular an empty list is returned if no such representation is available.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">AllAtlasGeneratingSetInfos( "A5", IsPermGroup, true );</span>
[ rec( groupname := "A5", id := "",
identifier := [ "A5", [ "A5G1-p5B0.m1", "A5G1-p5B0.m2" ], 1, 5 ]
, isPrimitive := true, maxnr := 1, p := 5, rankAction := 2,
repname := "A5G1-p5B0", repnr := 1, size := 60,
stabilizer := "A4", standardization := 1, transitivity := 3,
type := "perm" ),
rec( groupname := "A5", id := "",
identifier := [ "A5", [ "A5G1-p6B0.m1", "A5G1-p6B0.m2" ], 1, 6 ]
, isPrimitive := true, maxnr := 2, p := 6, rankAction := 2,
repname := "A5G1-p6B0", repnr := 2, size := 60,
stabilizer := "D10", standardization := 1, transitivity := 2,
type := "perm" ),
rec( groupname := "A5", id := "",
identifier := [ "A5", [ "A5G1-p10B0.m1", "A5G1-p10B0.m2" ], 1,
10 ], isPrimitive := true, maxnr := 3, p := 10,
rankAction := 3, repname := "A5G1-p10B0", repnr := 3,
size := 60, stabilizer := "S3", standardization := 1,
transitivity := 1, type := "perm" ) ]
</pre></div>
<p>Note that a matrix representation in any characteristic can be obtained by reducing a permutation representation or an integral matrix representation; however, the <strong class="pkg">ATLAS</strong> of Group Representations does not <em>store</em> such a representation (cf. Section <a href="chap3.html#X87D26B13819A8209"><span class="RefLink">3.1</span></a>).</p>
<p><a id="X80AABEE783363B70" name="X80AABEE783363B70"></a></p>
<h5>3.5-7 <span class="Heading">AtlasGroup</span></h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasGroup</code>( [<var class="Arg">gapname</var>[, <var class="Arg">std</var>, ]][<var class="Arg">...</var>] )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasGroup</code>( <var class="Arg">identifier</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: a group that satisfies the conditions, or <code class="keyw">fail</code>.</p>
<p><code class="func">AtlasGroup</code> takes the same arguments as <code class="func">OneAtlasGeneratingSetInfo</code> (<a href="chap3.html#X841478AB7CD06D44"><span class="RefLink">3.5-5</span></a>), and returns the group generated by the <code class="code">generators</code> component of the record that is returned by <code class="func">OneAtlasGeneratingSetInfo</code> (<a href="chap3.html#X841478AB7CD06D44"><span class="RefLink">3.5-5</span></a>) with these arguments; if <code class="func">OneAtlasGeneratingSetInfo</code> (<a href="chap3.html#X841478AB7CD06D44"><span class="RefLink">3.5-5</span></a>) returns <code class="keyw">fail</code> then also <code class="func">AtlasGroup</code> returns <code class="keyw">fail</code>.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">g:= AtlasGroup( "A5" );</span>
Group([ (1,2)(3,4), (1,3,5) ])
</pre></div>
<p>Alternatively, it is possible to enter exactly one argument, a record <var class="Arg">identifier</var> as returned by <code class="func">OneAtlasGeneratingSetInfo</code> (<a href="chap3.html#X841478AB7CD06D44"><span class="RefLink">3.5-5</span></a>) or <code class="func">AllAtlasGeneratingSetInfos</code> (<a href="chap3.html#X84C2D76482E60E42"><span class="RefLink">3.5-6</span></a>), or the <code class="code">identifier</code> component of such a record.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">info:= OneAtlasGeneratingSetInfo( "A5" );</span>
rec( groupname := "A5", id := "",
identifier := [ "A5", [ "A5G1-p5B0.m1", "A5G1-p5B0.m2" ], 1, 5 ],
isPrimitive := true, maxnr := 1, p := 5, rankAction := 2,
repname := "A5G1-p5B0", repnr := 1, size := 60, stabilizer := "A4",
standardization := 1, transitivity := 3, type := "perm" )
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasGroup( info );</span>
Group([ (1,2)(3,4), (1,3,5) ])
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasGroup( info.identifier );</span>
Group([ (1,2)(3,4), (1,3,5) ])
</pre></div>
<p>In the groups returned by <code class="func">AtlasGroup</code>, the value of the attribute <code class="func">AtlasRepInfoRecord</code> (<a href="chap3.html#X87AFEC90873BCDD1"><span class="RefLink">3.5-9</span></a>) is set. This information is used for example by <code class="func">AtlasSubgroup</code> (<a href="chap3.html#X7A3E460C82B3D9A3"><span class="RefLink">3.5-8</span></a>) when this function is called with second argument a group created by <code class="func">AtlasGroup</code>.</p>
<p><a id="X7A3E460C82B3D9A3" name="X7A3E460C82B3D9A3"></a></p>
<h5>3.5-8 <span class="Heading">AtlasSubgroup</span></h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasSubgroup</code>( <var class="Arg">gapname</var>[, <var class="Arg">std</var>][, <var class="Arg">...</var>], <var class="Arg">maxnr</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasSubgroup</code>( <var class="Arg">identifier</var>, <var class="Arg">maxnr</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasSubgroup</code>( <var class="Arg">G</var>, <var class="Arg">maxnr</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: a group that satisfies the conditions, or <code class="keyw">fail</code>.</p>
<p>The arguments of <code class="func">AtlasSubgroup</code>, except the last argument <var class="Arg">maxn</var>, are the same as for <code class="func">AtlasGroup</code> (<a href="chap3.html#X80AABEE783363B70"><span class="RefLink">3.5-7</span></a>). If the <strong class="pkg">ATLAS</strong> of Group Representations provides a straight line program for restricting representations of the group with name <var class="Arg">gapname</var> (given w.r.t. the <var class="Arg">std</var>-th standard generators) to the <var class="Arg">maxnr</var>-th maximal subgroup and if a representation with the required properties is available, in the sense that calling <code class="func">AtlasGroup</code> (<a href="chap3.html#X80AABEE783363B70"><span class="RefLink">3.5-7</span></a>) with the same arguments except <var class="Arg">maxnr</var> yields a group, then <code class="func">AtlasSubgroup</code> returns the restriction of this representation to the <var class="Arg">maxnr</var>-th maximal subgroup.</p>
<p>In all other cases, <code class="keyw">fail</code> is returned.</p>
<p>Note that the conditions refer to the group and not to the subgroup. It may happen that in the restriction of a permutation representation to a subgroup, fewer points are moved, or that the restriction of a matrix representation turns out to be defined over a smaller ring. Here is an example.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">g:= AtlasSubgroup( "A5", NrMovedPoints, 5, 1 );</span>
Group([ (1,5)(2,3), (1,3,5) ])
<span class="GAPprompt">gap></span> <span class="GAPinput">NrMovedPoints( g );</span>
4
</pre></div>
<p>Alternatively, it is possible to enter exactly two arguments, the first being a record <var class="Arg">identifier</var> as returned by <code class="func">OneAtlasGeneratingSetInfo</code> (<a href="chap3.html#X841478AB7CD06D44"><span class="RefLink">3.5-5</span></a>) or <code class="func">AllAtlasGeneratingSetInfos</code> (<a href="chap3.html#X84C2D76482E60E42"><span class="RefLink">3.5-6</span></a>), or the <code class="code">identifier</code> component of such a record, or a group <var class="Arg">G</var> constructed with <code class="func">AtlasGroup</code> (<a href="chap3.html#X80AABEE783363B70"><span class="RefLink">3.5-7</span></a>).</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">info:= OneAtlasGeneratingSetInfo( "A5" );</span>
rec( groupname := "A5", id := "",
identifier := [ "A5", [ "A5G1-p5B0.m1", "A5G1-p5B0.m2" ], 1, 5 ],
isPrimitive := true, maxnr := 1, p := 5, rankAction := 2,
repname := "A5G1-p5B0", repnr := 1, size := 60, stabilizer := "A4",
standardization := 1, transitivity := 3, type := "perm" )
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasSubgroup( info, 1 );</span>
Group([ (1,5)(2,3), (1,3,5) ])
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasSubgroup( info.identifier, 1 );</span>
Group([ (1,5)(2,3), (1,3,5) ])
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasSubgroup( AtlasGroup( "A5" ), 1 );</span>
Group([ (1,5)(2,3), (1,3,5) ])
</pre></div>
<p><a id="X87AFEC90873BCDD1" name="X87AFEC90873BCDD1"></a></p>
<h5>3.5-9 AtlasRepInfoRecord</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AtlasRepInfoRecord</code>( <var class="Arg">G</var> )</td><td class="tdright">( attribute )</td></tr></table></div>
<p>Returns: the record stored in the group <var class="Arg">G</var> when this was constructed with <code class="func">AtlasGroup</code> (<a href="chap3.html#X80AABEE783363B70"><span class="RefLink">3.5-7</span></a>).</p>
<p>For a group <var class="Arg">G</var> that has been constructed with <code class="func">AtlasGroup</code> (<a href="chap3.html#X80AABEE783363B70"><span class="RefLink">3.5-7</span></a>), the value of this attribute is the info record that describes <var class="Arg">G</var>, in the sense that this record was the first argument of the call to <code class="func">AtlasGroup</code> (<a href="chap3.html#X80AABEE783363B70"><span class="RefLink">3.5-7</span></a>), or it is the result of the call to <code class="func">OneAtlasGeneratingSetInfo</code> (<a href="chap3.html#X841478AB7CD06D44"><span class="RefLink">3.5-5</span></a>) with the conditions that were listed in the call to <code class="func">AtlasGroup</code> (<a href="chap3.html#X80AABEE783363B70"><span class="RefLink">3.5-7</span></a>).</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">AtlasRepInfoRecord( AtlasGroup( "A5" ) );</span>
rec( groupname := "A5", id := "",
identifier := [ "A5", [ "A5G1-p5B0.m1", "A5G1-p5B0.m2" ], 1, 5 ],
isPrimitive := true, maxnr := 1, p := 5, rankAction := 2,
repname := "A5G1-p5B0", repnr := 1, size := 60, stabilizer := "A4",
standardization := 1, transitivity := 3, type := "perm" )
</pre></div>
<p><a id="X7A27E82E8480B92B" name="X7A27E82E8480B92B"></a></p>
<h4>3.6 <span class="Heading"><strong class="pkg">Browse</strong> Applications Provided by
<strong class="pkg">AtlasRep</strong></span></h4>
<p>The functions <code class="func">BrowseMinimalDegrees</code> (<a href="chap3.html#X7F31A7CB841FE63F"><span class="RefLink">3.6-1</span></a>), <code class="func">BrowseBibliographySporadicSimple</code> (<a href="chap3.html#X84ED4FC182C28198"><span class="RefLink">3.6-2</span></a>), and <code class="func">BrowseAtlasInfo</code> (<span class="RefLink">???</span>) (an alternative to <code class="func">DisplayAtlasInfo</code> (<a href="chap3.html#X79DACFFA7E2D1A99"><span class="RefLink">3.5-1</span></a>)) are available only if the <strong class="pkg">GAP</strong> package <strong class="pkg">Browse</strong> (see <a href="chapBib.html#biBBrowse">[BL14]</a>) is loaded.</p>
<p><a id="X7F31A7CB841FE63F" name="X7F31A7CB841FE63F"></a></p>
<h5>3.6-1 BrowseMinimalDegrees</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ BrowseMinimalDegrees</code>( [<var class="Arg">groupnames</var>] )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the list of info records for the clicked representations.</p>
<p>If the <strong class="pkg">GAP</strong> package <strong class="pkg">Browse</strong> (see <a href="chapBib.html#biBBrowse">[BL14]</a>) is loaded then this function is available. It opens a browse table whose rows correspond to the groups for which the <strong class="pkg">ATLAS</strong> of Group Representations contains some information about minimal degrees, whose columns correspond to the characteristics that occur, and whose entries are the known minimal degrees.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">if IsBound( BrowseMinimalDegrees ) then</span>
<span class="GAPprompt">></span> <span class="GAPinput"> down:= NCurses.keys.DOWN;; DOWN:= NCurses.keys.NPAGE;;</span>
<span class="GAPprompt">></span> <span class="GAPinput"> right:= NCurses.keys.RIGHT;; END:= NCurses.keys.END;;</span>
<span class="GAPprompt">></span> <span class="GAPinput"> enter:= NCurses.keys.ENTER;; nop:= [ 14, 14, 14 ];;</span>
<span class="GAPprompt">></span> <span class="GAPinput"> # just scroll in the table</span>
<span class="GAPprompt">></span> <span class="GAPinput"> BrowseData.SetReplay( Concatenation( [ DOWN, DOWN, DOWN,</span>
<span class="GAPprompt">></span> <span class="GAPinput"> right, right, right ], "sedddrrrddd", nop, nop, "Q" ) );</span>
<span class="GAPprompt">></span> <span class="GAPinput"> BrowseMinimalDegrees();;</span>
<span class="GAPprompt">></span> <span class="GAPinput"> # restrict the table to the groups with minimal ordinary degree 6</span>
<span class="GAPprompt">></span> <span class="GAPinput"> BrowseData.SetReplay( Concatenation( "scf6",</span>
<span class="GAPprompt">></span> <span class="GAPinput"> [ down, down, right, enter, enter ] , nop, nop, "Q" ) );</span>
<span class="GAPprompt">></span> <span class="GAPinput"> BrowseMinimalDegrees();;</span>
<span class="GAPprompt">></span> <span class="GAPinput"> BrowseData.SetReplay( false );</span>
<span class="GAPprompt">></span> <span class="GAPinput">fi;</span>
</pre></div>
<p>If an argument <var class="Arg">groupnames</var> is given then it must be a list of group names of the <strong class="pkg">ATLAS</strong> of Group Representations; the browse table is then restricted to the rows corresponding to these group names and to the columns that are relevant for these groups. A perhaps interesting example is the subtable with the data concerning sporadic simple groups and their covering groups, which has been published in <a href="chapBib.html#biBJan05">[Jan05]</a>. This table can be shown as follows.</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">if IsBound( BrowseMinimalDegrees ) then</span>
<span class="GAPprompt">></span> <span class="GAPinput"> # just scroll in the table</span>
<span class="GAPprompt">></span> <span class="GAPinput"> BrowseData.SetReplay( Concatenation( [ DOWN, DOWN, DOWN, END ],</span>
<span class="GAPprompt">></span> <span class="GAPinput"> "rrrrrrrrrrrrrr", nop, nop, "Q" ) );</span>
<span class="GAPprompt">></span> <span class="GAPinput"> BrowseMinimalDegrees( BibliographySporadicSimple.groupNamesJan05 );;</span>
<span class="GAPprompt">></span> <span class="GAPinput">fi;</span>
</pre></div>
<p>The browse table does not contain rows for the groups <span class="SimpleMath">6.M_22</span>, <span class="SimpleMath">12.M_22</span>, <span class="SimpleMath">6.Fi_22</span>. Note that in spite of the title of <a href="chapBib.html#biBJan05">[Jan05]</a>, the entries in Table 1 of this paper are in fact the minimal degrees of faithful <em>irreducible</em> representations, and in the above three cases, these degrees are larger than the minimal degrees of faithful representations. The underlying data of the browse table is about the minimal faithful (but not necessarily irreducible) degrees.</p>
<p>The return value of <code class="func">BrowseMinimalDegrees</code> is the list of <code class="func">OneAtlasGeneratingSetInfo</code> (<a href="chap3.html#X841478AB7CD06D44"><span class="RefLink">3.5-5</span></a>) values for those representations that have been "clicked" in visual mode.</p>
<p>The variant without arguments of this function is also available in the menu shown by <code class="func">BrowseGapData</code> (<span class="RefLink">???</span>).</p>
<p><a id="X84ED4FC182C28198" name="X84ED4FC182C28198"></a></p>
<h5>3.6-2 BrowseBibliographySporadicSimple</h5>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ BrowseBibliographySporadicSimple</code>( )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: a record as returned by <code class="func">ParseBibXMLExtString</code> (<a href="../../../pkg/GAPDoc/doc/chap7.html#X86BD29AE7A453721"><span class="RefLink">GAPDoc: ParseBibXMLextString</span></a>).</p>
<p>If the <strong class="pkg">GAP</strong> package <strong class="pkg">Browse</strong> (see <a href="chapBib.html#biBBrowse">[BL14]</a>) is loaded then this function is available. It opens a browse table whose rows correspond to the entries of the bibliographies in the <strong class="pkg">ATLAS</strong> of Finite Groups <a href="chapBib.html#biBCCN85">[CCNPW85]</a> and in the <strong class="pkg">ATLAS</strong> of Brauer Characters <a href="chapBib.html#biBJLPW95">[JLPW95]</a>.</p>
<p>The function is based on <code class="func">BrowseBibliography</code> (<span class="RefLink">???</span>), see the documentation of this function for details, e.g., about the return value.</p>
<p>The returned record encodes the bibliography entries corresponding to those rows of the table that are "clicked" in visual mode, in the same format as the return value of <code class="func">ParseBibXMLExtString</code> (<a href="../../../pkg/GAPDoc/doc/chap7.html#X86BD29AE7A453721"><span class="RefLink">GAPDoc: ParseBibXMLextString</span></a>), see the manual of the <strong class="pkg">GAP</strong> package <strong class="pkg">GAPDoc</strong> <a href="chapBib.html#biBGAPDoc">[LN12]</a> for details.</p>
<p><code class="func">BrowseBibliographySporadicSimple</code> can be called also via the menu shown by <code class="func">BrowseGapData</code> (<span class="RefLink">???</span>).</p>
<div class="example"><pre>
<span class="GAPprompt">gap></span> <span class="GAPinput">if IsBound( BrowseBibliographySporadicSimple ) then</span>
<span class="GAPprompt">></span> <span class="GAPinput"> enter:= NCurses.keys.ENTER;; nop:= [ 14, 14, 14 ];;</span>
<span class="GAPprompt">></span> <span class="GAPinput"> BrowseData.SetReplay( Concatenation(</span>
<span class="GAPprompt">></span> <span class="GAPinput"> # choose the application</span>
<span class="GAPprompt">></span> <span class="GAPinput"> "/Bibliography of Sporadic Simple Groups", [ enter, enter ],</span>
<span class="GAPprompt">></span> <span class="GAPinput"> # search in the title column for the Atlas of Finite Groups</span>
<span class="GAPprompt">></span> <span class="GAPinput"> "scr/Atlas of finite groups", [ enter,</span>
<span class="GAPprompt">></span> <span class="GAPinput"> # and quit</span>
<span class="GAPprompt">></span> <span class="GAPinput"> nop, nop, nop, nop ], "Q" ) );</span>
<span class="GAPprompt">></span> <span class="GAPinput"> BrowseGapData();;</span>
<span class="GAPprompt">></span> <span class="GAPinput"> BrowseData.SetReplay( false );</span>
<span class="GAPprompt">></span> <span class="GAPinput">fi;</span>
</pre></div>
<p>The bibliographies contained in the <strong class="pkg">ATLAS</strong> of Finite Groups <a href="chapBib.html#biBCCN85">[CCNPW85]</a> and in the <strong class="pkg">ATLAS</strong> of Brauer Characters <a href="chapBib.html#biBJLPW95">[JLPW95]</a> are available online in HTML format, see <span class="URL"><a href="http://www.math.rwth-aachen.de/~Thomas.Breuer/atlasrep/bibl/index.html">http://www.math.rwth-aachen.de/~Thomas.Breuer/atlasrep/bibl/index.html</a></span>.</p>
<p>The source data in BibXMLext format, which are used by <code class="func">BrowseBibliographySporadicSimple</code>, is part of the <strong class="pkg">AtlasRep</strong> package, in four files with suffix <code class="file">xml</code> in the package's <code class="file">bibl</code> directory. Note that each of the two books contains two bibliographies.</p>
<p>Details about the BibXMLext format, including information how to transform the data into other formats such as BibTeX, can be found in the <strong class="pkg">GAP</strong> package <strong class="pkg">GAPDoc</strong> (see <a href="chapBib.html#biBGAPDoc">[LN12]</a>).</p>
<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap2.html">[Previous Chapter]</a> <a href="chap4.html">[Next Chapter]</a> </div>
<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><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="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>
<hr />
<p class="foot">generated by <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>
|