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 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137
|
% This file was created automatically from code.msk.
% DO NOT EDIT!
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%W code.msk The Matrix Schreier Sims package - Documentation
%%
%H File : $RCSfile: code.tex,v $
%H Author : Henrik Bäärnhielm
%H Dev start : 2004-07-28
%%
%H Version : $Revision: 1.6 $
%H Date : $Date: 2004/10/07 21:42:54 $
%H Last edit : $Author: redstar_ $
%%
%H @(#)$Id: code.tex,v 1.6 2004/10/07 21:42:54 redstar_ Exp $
%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\Chapter{Implementation}
Here is the documentation from the package source code. As the package
works with matrix groups acting on vector spaces, references to <group
elements> means <matrices>, ie a list of row vectors, each of which is
list of field elements. References to <points> means <row vectors>, ie
elements of the vector space on which the group acts.
The code tries to avoid the computation of inverse matrices as much as
possible, and to accomplish this, the inverse of a group element is
stored together with the element in a list of length 2. Each time some
computation is made with the element, a similar computation is made
with the inverse, so that they are kept consistent. Therefore, in many
cases in the code, <group element> means an immutable list of 2
matrices that are inverses to each other.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\Section{General code}
These are the general declarations used by the package. Most notably the
attribute `StabChainMatrixGroup' which is the core of the package
functionality.
\>`StabChainMatrixGroup( G )'{StabChainMatrixGroup}!{general} A
Declare new attribute for storing base, SGS and Schreier trees.
The attribute is computed using the Schreier-Sims algorithm for finite
matrix groups, which is the main content of the package.
The attribute is a record with two components:
\beginitems
`SchreierStructure' & the main information structure, see "ssInfo".
`SGS' & a list of the strong generators
\enditems
The corresponding attribute operations are aware of a few Options.
\beginitems
`SimpleSchreierTree' & calculate coset representatives at the moment of
creation of the Schreier trees, thus making them
have height 1.
This should make the algorithm significantly
faster.
`ExtendSchreierTree' & Do not recompute Schreier trees at each run of a
given level, but extend the Schreier trees from
the last run at that level.
`AlternatingActions' & Always prepend a base point with the line that
contains it, using the projective action on the
line.
`CleverBasePoints' & Choose an initial list of base points using
`BasisVectorsForMatrixAction', which is made by
O'Brien and Murray.
`ShallowSchreierTree' & Create the Schreier trees using the method described
by Babai et al (1991) which guarantees logarithmic
depth. This Option is only used when the option
`SimpleSchreierTree' is <not> defined.
`Random' & Use probabilistic algorithm.
`Linear' & Use nearly linear-time algorithm. This takes precedence over
`Random', if it is present.
\enditems
\>`ssInfo' V
Main structure holding information for the algorithm. This is not a global
variable, but the same structure is used in all the variants of the
algorithm, but all members are not necessarily used.
The structure `ssInfo' is a list of records, with a record for each level
in the algorithm, ie one record for each base point. New base points
may of course be added to the base during the execution of the algorithm,
and then a new record is added to the end of the list.
The members of the record are:
\beginitems
`partialSGS' & the elements in the current partial SGS that fixes all
points at lower levels, or the whole partial SGS for the
first level
`partialBase' & the base point for this level
`action' & the action (function) at this level
`points' & the field where the base point `partialBase' comes from
`hash' & the hash function for the Schreier tree at this level
`schreierTree' & the Schreier tree for this level, representing the
basic orbit at this level, ie the orbit of `partialBase'
under the action of `partialSGS' at the previous (lower)
level. Thus, the root of the tree is `partialBase'.
`oldSGS' & the whole partial SGS at the last call of SchreierSims at
this level
`IsIdentity' & the function to check if a point is the identity at this
level
\>`MatrixSchreierSimsInfo' V
The {\GAP} InfoClass used by the package, for debugging purposes.
\>`MATRIXSS_DEBUGLEVEL'{MATRIXSS_DEBUGLEVEL} V
The internal debugging level. This is really obsolete and the above info
class should be used instead.
\>`MATRIXSS_BasePointStore' V
A list of hopefully good base points, ie base points with small orbits.
They are fetched with `BasisVectorsForMatrixAction' which is due to
O{\rq}Brien and Murray, and as long as the list is non-empty,
new base points will be shifted from it.
\>`MatrixGroupOrderStabChain( ssInfo )'{MatrixGroupOrderStabChain![code.gd]}@{`MatrixGroupOrderStabChain'!`[code.gd]'} F
Computes the order of the group defined by the given Schreier trees, see
"ssInfo".
These are the common functions used by all the variants of the Schreier-Sims
algorithm implemented in the package.
These are the core functions of the package.
\>`Size( G )'{Size}!{finite matrix group} A
A method for `Size' for finite matrix groups, that uses the implementation
of Schreier-Sims algorithm in this package, ie it uses the
`StabChainMatrixGroup' attribute to compute the order of `G'.
This method is only installed if `MATRIXSS_TEST' is not defined when the
package is loaded.
\>MATRIXSS_GetPartialBaseSGS( generators, identity, field ) F
Constructs a partial base and a partial SGS given a set of generators
for a group. Returns the partial SGS and the `ssInfo' structure,
see "ssInfo".
\beginitems
`generators' & given set of generators
`identity' & group identity element (the identity matrix)
`field' & the vector space on which the group acts
\enditems
\>`MATRIXSS_Membership( ssInfo, element, identity )'{MATRIXSS_Membership} F
Check if an element belongs to a group, using sifting
\beginitems
`ssInfo' & Main information structure about our stabiliser chain. The Schreier
trees is used during the sifting.
`element' & the element to check for membership
`identity' & group identity
\enditems
\>MATRIXSS_NewBasePoint( element, identity, field ) F
Find a point not in base that is moved by the given element
(which fixes the base)
\beginitems
`element' & the bad element that fixes the whole base
`identity' & the group identity (the identity matrix)
`field' & the vector space on which the group acts
\enditems
\>`MATRIXSS_GetSchreierGenerator( schreierTree, generator, point, action, identity, IsIdentity )'{MATRIXSS_GetSchreierGenerator} F
Creates a Schreier generator for the stabiliser in the group which has
`generator' as one of its generators. The stabiliser fixes `point' under
`action'.
\>MATRIXSS_ExtendBase( ssInfo, badElement, identity ) F
Add a new base point to the base, so that the given element is not in the
stabiliser of the point
\beginitems
`ssInfo' & main information structure for the current Schreier-Sims run
`badElement' & the element that fixes all current base points
`identity' & the group identity
\enditems
\>MATRIXSS_AugmentBase( ssInfo, newPoint, action, hash, identity ) F
Add a new base point to the base, so that the given element is not in the
stabiliser of the point
\beginitems
`ssInfo' & main information structure for the current Schreier-Sims run
`newPoint' & the point to add to the base
`action' & the action for the new point
`hash' & the dictionary info for the new point
`identity' & the group identity
\enditems
\>`MATRIXSS_OrbitElement( schreierTree, point, action, identity, IsIdentity )'{MATRIXSS_OrbitElement} F
Compute the group element that connects the root of the Schreier tree to
a given point. This function assumes that the point actually is in the
orbit described by the given Schreier tree.
\beginitems
`schreierTree' & Schreier tree for the orbit to use
`point' & the point to check if it is in the orbit
`action' & the action that was used to create the Schreier tree
`identity' & the group identity (the identity matrix)
`IsIdentity' & function to use when checking if a group element is equal
to the identity
\enditems
\>MATRIXSS_ComputeSchreierTree( tree, generators, action, root, hash, identity ) F
Fill a Schreier tree that contains only the root.
\beginitems
`tree' & The Schreier tree to fill.
`generators' & The generators for the group that gives rise to the orbit
represented by the Schreier tree.
`action' & The action of the group on the point set.
`root' & The root point of the tree.
`hash' & The dictionary info for the tree, used to create hash function.
`identity' & the group identity (the identity matrix)
\enditems
\>MATRIXSS_ExtendSchreierTree( oldTree, generators, oldGenerators, action, dictinfo ) F
Extends an existing Schreier tree by a given set of generators
\beginitems
`oldTree' & The Schreier tree to extend, ie a Dictionary.
`generators' & The generators for the group that gives rise to the orbit
represented by the Schreier tree.
`oldGenerators' & The current generators (edge-labels) of `oldTree'.
`action' & The action of the group on the point set.
`dictinfo' & The Dictionary info used when `oldTree' was created.
\enditems
\>`MATRIXSS_OrbitElement_ToddCoxeter( schreierTree, point, action, identity, IsIdentity, freeGroup, genMap )'{MATRIXSS_OrbitElement_ToddCoxeter} F
Special version of `MATRIXSS_OrbitElement', see "MATRIXSS_OrbitElement",
that also calculates the Word in the generators of the group element it
returns.
More specifically, it computes the Word of the generators of the
corresponding free group.
\beginitems
`schreierTree' & Schreier tree for the orbit to use
`point' & the point to check if it is in the orbit
`action' & the action that was used to create the Schreier tree
`identity' & the group identity (the identity matrix)
`IsIdentity' & function to use when checking if a group element is equal
to the identity
`freeGroup' & corresponding free group to the group whose generators form
the set of edge labels of `schreierTree'
`genMap' & list of 2 lists of the same length, the first being the edge
labels of `schreierTree' (the generators of the corresponding
group), and the second being the corresponding generators of
`freeGroup'
\enditems
\>MATRIXSS_Membership_ToddCoxeter( ssInfo, element, identity, freeGroup ) F
Special version of `MATRIXSS_Membership', see "MATRIXSS_Membership", that
also expresses the sifted group element as a word in the generators of a
given free group.
\beginitems
`ssInfo' & Main information structure about our stabiliser chain.
The Schreier trees is used during the sifting.
`element' & the element to check for membership
`identity' & group identity
`freeGroup' & the free group in which the sifted element will be expressed
\enditems
\>MATRIXSS_GetSchreierGenerator_ToddCoxeter( schreierTree, generator, point, action, identity, IsIdentity, freeGroup, genMap ) F
Special version of `MATRIXSS_GetSchreierGenerator', see
"MATRIXSS_GetSchreierGenerator", that also returns the Schreier generator
as a Word in the generators of `freeGroup', using `genMap' to map the
generators to the free group. See "MATRIXSS_OrbitElement_ToddCoxeter".
\>MATRIXSS_CreateShallowSchreierTree( orbitTree, root, generators, labels, action, identity, hash ) F
Create a shallow Schreier tree, ie with at most logarithmic height.
\beginitems
`orbitTree' & Given tree representing the same orbit as the shallow Schreier
to be computed.
`root' & The root point of the tree.
`generators' & From this set will any new edge labels be taken.
`labels' & The elements that, together with its inverses, will form the
edge labels of the tree.
`action' & The action of the group on the point set.
`identity' & the group identity (the identity matrix)
`hash' & The dictionary info for the tree, used to create hash function.
\enditems
\>MATRIXSS_GetSchreierTree( oldTree, root, generators, oldGenerators, action, hash, identity ) F
Returns a Schreier tree. This routine encapsulates the other Schreier tree
functions.
\beginitems
`oldTree' & The Schreier tree to extend, in case there should be an
extension.
`root' & The root point of the tree.
`generators' & The generators for the group that gives rise to the orbit
represented by the Schreier tree.
`oldGenerators' & The current generators (edge-labels) of `oldTree'.
`action' & The action of the group on the point set.
`hash' & The dictionary info for the tree, used to create hash function.
`identity' & the group identity (the identity matrix)
\enditems
\>MATRIXSS_MonotoneTree( root, elements, action, identity, dictinfo ) F
Create a monotone Schreier tree with given root and edge labels.
\beginitems
`root' & The root point of the tree.
`elements' & The elements that, together with its inverses, will form the
edge labels of the tree.
`action' & The action of the group on the point set.
`identity' & the group identity (the identity matrix)
`dictinfo' & The dictionary info for the tree, used to create hash function.
\enditems
\>MATRIXSS_RandomCosetRepresentative( schreierTree, action, identity ) F
Return a random coset representative from the transversal defined by
`schreierTree'.
\>MATRIXSS_RandomOrbitPoint( schreierTree ) F
Returns a random point in the orbit given by `schreierTree'.
\>MATRIXSS_RandomSchreierGenerator( schreierTree, elements, action, identity ) F
Return a random Schreier generator constructed from the points in
`schreierTree' and the generators in `elements'.
\>MATRIXSS_RandomSubproduct( elements, identity ) F
Return a random subproduct of `elements'.
These are also core function, but of slightly less importance, or mainly of technical nature.
\>`MATRIXSS_SubProdGroups' V
A Dictionary of SymmetricGroups, used when permuting random subproducts.
\>MATRIXSS_CopySchreierTree( tree, dictinfo ) F
Creates a copy of a whole Schreier tree, ie of makes a copy of the
Dictionary.
\beginitems
`tree' & the Dictionary to copy
`dictinfo' & the dictinfo that was used when creating `tree'
\enditems
\>MATRIXSS_GetOrbitSize( schreierTree ) F
Get size of orbit defined by the given Schreier tree.
\>MATRIXSS_GetOrbit( schreierTree ) F
Return all points (as a list) in the orbit of the point which is root of
the Schreier tree, ie return all keys in the Dictionary.
The list is not necessarily sorted, and it is mutable.
\>MATRIXSS_IsPointInOrbit( schreierTree, point ) F
Check if the given point is in the orbit defined by the given Schreier tree.
\>MATRIXSS_CreateInitialSchreierTree( root, dictinfo, identity ) F
Create a Schreier tree containing only the root.
\beginitems
`root' & The base point that is to be the root of the Schreier tree.
`dictinfo' & Used when creating the Dictionary that is the Schreier tree
`identity' & the group identity element
\enditems
\>MATRIXSS_GetSchreierTreeEdge( schreierTree, point ) F
Get the label of the edge originating at the given point, and directed
towards the root of the given Schreier tree.
\>MATRIXSS_ProjectiveIsIdentity( element, identity ) F
Identity check when using projective action (all scalar matrices are
considered equal to the identity)
\beginitems
`element' & the group element to check if it is equal to identity
`identity' & the group identity (the identity matrix)
\enditems
\>MATRIXSS_IsIdentity( element, identity ) F
Identity check when using normal point action
\beginitems
`element' & the group element to check if it is equal to identity
`identity' & the group identity (the identity matrix)
\enditems
\>MATRIXSS_PointAction( point, element ) F
The action of a group element (a matrix) on a point (a row vector).
The action is from the right
\beginitems
`point' & The point (row vector) to act on.
`element' & The group element (matrix) that acts.
\enditems
\>MATRIXSS_ProjectiveAction( point, element ) F
The projective action of a matrix on a row vector.
The one-dimensional subspace corresponding to the point is represented
by the corresponding normed row vector
\beginitems
`point' & The point to act on. Must be a *normed* row vector.
`element' & The group element (matrix) that acts.
\enditems
\>MATRIXSS_DebugPrint( level, message ) F
Internal function for printing debug messages. Uses the internal variable
`MATRIXSS_DEBUGLEVEL', see "MATRIXSS_DEBUGLEVEL", to determine if the
message should be printed.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\Section{Deterministic algorithm}
These are the special routines for the deterministic version of
Schreier-Sims algorithm.
\>`StabChainMatrixGroup( G )'{StabChainMatrixGroup}!{deterministic} A
An implementation of the Schreier-Sims algorithm, for matrix groups,
probabilistic version. See "StabChainMatrixGroup!general" for general information
about the attribute.
\>SchreierSims( ssInfo, partialSGS, level, identity ) F
The main Schreier-Sims function, which is called for each level.
\beginitems
`ssInfo' & main information structure for the current Schreier-Sims run
`partialSGS' & given partial strong generating set
`level' & the level of the call to Schreier-Sims
`identity' & the group identity
\enditems
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\Section{Probabilistic algorithm}
These are the special routines for the probabilistic implementation of
Schreier-Sims algorithm.
\>`StabChainMatrixGroup( G )'{StabChainMatrixGroup}!{probabilistic} A
An implementation of the Schreier-Sims algorithm, for matrix groups,
probabilistic version. See "StabChainMatrixGroup!general" for general information
about the attribute.
In addition to the general Options of the attribute `StabChainMatrixGroup',
the probabilistic algorithm is aware of the following:
\beginitems
`Probability' & (lower bound for) probability of correct solution, which
defaults to 3/4
`Verify' & Boolean parameter which signifies if the base and SGS computed
using the random Schreir-Sims algorithm should be verified
using the Schreier-Todd-Coxeter-Sims algorithm.
Defaults to `false.'
`OrderLowerBound' & Lower bound for the order of `G', must be $\geq$ 1.
Defaults to 1.
`OrderUpperBound' & Upper bound for the order of `G', or 0 if unknown.
Defaults to 0.
Note that if the order of `G' is known, so that
`OrderLowerBound' = `OrderUpperBound' = `Size(G)'
then the randomized algorithm always produces a correct base and SGS, so
there is no need of verification. Also, the verification will extend the
given base and SGS to a complete base and SGS if needed.
\>RandomSchreierSims( ssInfo, partialSGS, maxIdentitySifts, identity, low_order, high_order ) F
The main random Schreier-Sims function.
\beginitems
`ssInfo' & main information structure for the Schreier-Sims
`partialSGS' & given partial strong generating set
`maxIdentitySifts' & maximum number of consecutive elements that sifts to
identity before the algorithm terminates
`identity' & the group identity
`lowOrder' & lower bound on the group order (must be $\geq$ 1)
`highOrder' & upper bound on the group order, or 0 if not available
\enditems
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\Section{STCS algorithm}
These are the Schreier-Todd-Coxeter-Sims routines, ie Schreier-Sims
algorithm with additional calls to Todd-Coxeter coset enumeration to
possibly speed up the process. It is known to be fast when the input is
already a base and SGS, and therefore it is good for verifying a proposed
base and SGS, for example the output of a probabilistic algorithm.
\>MATRIXSS_SchreierToddCoxeterSims( ssInfo, partialSGS, level, identity, cosetFactor ) F
The main function for the Schreier-Todd-Coxeter-Sims algorithm. It is very
similar to ordinary Schreier-Sims algorithm and has a similar interface.
\beginitems
`ssInfo' & main information structure for the current Schreier-Sims run
`partialSGS' & given partial strong generating set
`level' & the level of the call to Schreier-Sims
`identity' & the group identity
`cosetFactor' & the quotient of the maximum number of cosets generated
during coset enumeration and the corresponding orbit size
\enditems
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\Section{Nearly linear time algorithm}
These are the special routines for the nearly linear-time version, described
in Babai et al, 1991.
\>`StabChainMatrixGroup( G )'{StabChainMatrixGroup}!{nearly linear time} A
An implementation of the Schreier-Sims algorithm, for matrix groups.
This version is inspired by the nearly linear time algorithm, described in
\cite{seress03}. See "StabChainMatrixGroup!general" for general information
about the attribute.
\>ConstructSGS( ssInfo, partialSGS, identity ) F
The main Schreier-Sims function for the nearly linear-time algorithm.
\beginitems
`ssInfo' & main information structure for the current Schreier-Sims run
`partialSGS' & given partial strong generating set
`identity' & the group identity
\enditems
\>CompletePointStabiliserSubgroup( ssInfo, element, level, identity, maxIdentitySifts ) F
The work-horse of the nearly linear-time algorithm, called for each level.
\beginitems
`ssInfo' & main information structure for the current Schreier-Sims run
`element' & the element which
`partialSGS' & given partial strong generating set
`identity' & the group identity
\enditems
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\Section{Verify routine}
\>MatrixSchreierSimsVerify( ssInfo, SGS, identity ) F
The <Verify> routine by Sims. Checks whether the given `ssInfo' and `SGS'
encodes a base and strong generating set, and returns a record with
components `Residue' and `Level'. In case the verification succeeds, the
level is 0 and the residue is the identity. Otherwise the residue is an
element that is in the stabiliser of the group at the indicated level, but
is not in the group at the next higher level.
\beginitems
`ssInfo' & proposed structure to check
`SGS' & proposed SGS to check
`identity' & the group identity
\enditems
\>MATRIXSS_VerifyLevel( ssInfo, partialSGS, level, identity ) F
Checks that the stabiliser of the group at the given level is the same as
the group at the next higher level.
\beginitems
`ssInfo' & proposed structure to check
`partialSGS' & proposed SGS to check
`level' & level to check
`identity' & the group identity
\enditems
\>MATRIXSS_VerifyMultipleGenerators( generators, schreierTree, point, action, hash, subGenerators, ssInfo, SGS, identity, points, IsIdentity, field ) F
Verifies that the stabiliser of the group generated by `generators', at the
point `point' is the same group as the group generated by `generators' minus
`subGenerators'. If so, the identity is returned, and otherwise an element
that is in the difference is returned.
`ssInfo' and `SGS' should be a base and strong generating set for the
smaller group.
\beginitems
`generators' & generators of the bigger group
`schreierTree' & Schreier tree for the orbit of `point' under `action' of
the group generated by `generators'
`point' & the point to get the stabiliser of
`action' & the action to use when calculating the stabiliser
`hash' & the dictionary info of `schreierTree'
`subGenerators' & the additional generators of the bigger group
`ssInfo' & main structure for the base and sgs of the smaller group
`SGS' & strong generating set for the smaller group
`identity' & the group identity
`points' & the point set to which `point' belong
`IsIdentity' & the identity check function for the larger group
`field' & the finite field of the larger group
\enditems
\>MATRIXSS_VerifySingleGenerator( generators, schreierTree, point, action, hash, subGenerator, ssInfo, SGS, identity ) F
Verifies that the stabiliser of the group generated by `generators', at the
point `point' is the same group as the group generated by `generators' minus
`subGenerator'. If so, the identity is returned, and otherwise an element
that is in the difference is returned.
`ssInfo' and `SGS' should be a base and strong generating set for the
smaller group.
\beginitems
`generators' & generators of the bigger group
`schreierTree' & Schreier tree for the orbit of `point' under `action' of
the group generated by `generators'
`point' & the point to get the stabiliser of
`action' & the action to use when calculating the stabiliser
`hash' & the dictionary info of `schreierTree'
`subGenerator' & the additional generator of the bigger group
`ssInfo' & main structure for the base and sgs of the smaller group
`SGS' & strong generating set for the smaller group
`identity' & the group identity
\enditems
\>MATRIXSS_StabiliserGens( ssInfo, partialSGS, point, action, dictinfo, identity ) F
Return generators of the stabiliser of the group generated by the strong
generators `partialSGS' at `point' under `action'. The `ssInfo' structure
should be a base for the group.
\beginitems
`ssInfo' & main structure for the base
`partialSGS' & strong generating set for the given group
`point' & the point to get stabiliser at
`action' & the action to use when computing stabiliser
`dictinfo' & the dictionary info of `schreierTree'
`identity' & the group identity
\enditems
\>MATRIXSS_IsBlockOfImprimitivity( schreierTree, generators, block, action, identity ) F
Checks whether `block' is a block of imprimitivity for `action' of the group
given by `generators' on the set of points given by `schreierTree'.
\beginitems
`schreierTree' & Schreier tree for the point set
`generators' & generators of the acting group
`block' & the block to check for imprimitivity
`action' & the action to use
`identity' & the group identity
\enditems
\>MATRIXSS_DecomposeOrbit( schreierTree, root, generators, action, hash, identity ) F
Decompose the orbit given by `schreierTree', with root point `root', into
orbits of the group generated by `generators', under `action'.
\beginitems
`schreierTree' & Schreier tree for the orbit to decompose
`root' & root point of `schreierTree'
`generators' & generators of the decomposing group
`action' & the action of the decomposing group
`hash' & the dictionary info of `schreierTree'
`identity' & the group identity
\enditems
\>MATRIXSS_BaseChange( ssInfo, partialSGS, level, identity ) F
Flips the base point at `level' with the next higher base point and update
the `ssInfo' structure.
\beginitems
`ssInfo' & main structure for the base
`partialSGS' & strong generating set corresponding to `ssInfo'
`level' & the level for the base change
`identity' & the group identity
\enditems
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\Section{Test and benchmark routines}
These are the main routines for testing and benchmarking the package.
\>MatrixSchreierSimsTest( maxDegree, maxFieldSize ) F
Compares results of the above function with the built-in GAP Size method for
a bunch of classical matrix groups. (`GL', `SL', etc)
\beginitems
`maxDegree' & maximum matrix size for classical matrix groups to be used
for testing
`maxFieldSize' & maximum finite field size for classical matrix groups to be
used for testing
\enditems
\>MatrixSchreierSimsBenchmark( maxDegree, maxFieldSize, maxReeSize, maxSuzukiSize ) F
Check speed of package routines against classical matrix groups and the
matrix representations of Ree and Suzuki sporadic groups.
\beginitems
`maxDegree' & maximum matrix size for classical matrix groups to be used
for testing
`maxFieldSize' & maximum finite field size for classical matrix groups to be
used for testing
`maxReeSize' & maximum `ReeGroup' size, see "ref:Ree" in the reference
manual.
`maxSuzukiSize' & maximum `SuzukiGroup' size, see "ref:Sz" in the reference
manual.
\enditems
These are auxiliary functions for test and benchmark.
\>MATRIXSS_GetTestGroups( maxDegree, maxFieldSize ) F
Creates a list of classical matrix groups to use when testing the package.
The groups are `GL', `SL', `GO', `SO', `GU' and `SU'.
\beginitems
`maxDegree' & maximum matrix size for classical matrix groups to be used
for testing
`maxFieldSize' & maximum finite field size for classical matrix groups to be
used for testing
\enditems
\>MATRIXSS_GetBenchmarkGroups( maxDegree, maxFieldSize ) F
Creates a list of classical matrix groups and sporadic groups to use when
benchmarking the package.
The classical groups are `GL', `SL', `GO' and `SO'. The sporadic groups are
`Ree' and `Sz'.
\beginitems
`maxDegree' & maximum matrix size for classical matrix groups to be used
for testing
`maxFieldSize' & maximum finite field size for classical matrix groups to be
used for testing
`maxReeSize' & maximum `ReeGroup' size, see "ref:Ree" in the reference
manual.
`maxSuzukiSize' & maximum `SuzukiGroup' size, see "ref:Sz" in the reference
manual.
\enditems
\>MATRIXSS_TimedCall( call, args ) F
Runs the specified function with arguments and return the running time in
milliseconds, as given by Runtime, see "ref:Runtime" in the reference
manual.
\beginitems
`call' & function to call
`args' & list of arguments to `call'
\enditems
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%E code.msk . . . . . . . . . . . . . . . . . . . . . . . . . . ends here
|