-
Notifications
You must be signed in to change notification settings - Fork 120
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- name changes as suggested in the comments - use `GAPWrap` where possible - change the `show` method (no newline in the end, fewer linebreaks) - do not call `_oscar_group` - add `Base.in` method - add `straight_line_program` for recognition trees (and for GAP slps) - add a few tests - add initial documentation of group recognition
- Loading branch information
1 parent
a27b075
commit d4200b0
Showing
8 changed files
with
262 additions
and
61 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,27 @@ | ||
```@meta | ||
CurrentModule = Oscar | ||
DocTestSetup = Oscar.doctestsetup() | ||
``` | ||
|
||
# Group recognition | ||
|
||
The idea of constructive group recognition is to compute a *recognition tree* | ||
for a given (permutation or matrix) group, which describes the structure | ||
of this group in a recursive way: | ||
Each non-leaf node of the tree describes an epimorphism such that | ||
the kernel and the image belong to the two subtrees of the node. | ||
Each leaf node describes a group for which efficient methods are available | ||
that allow one to decide whether a group element is an element of this group, | ||
and if yes to write the element as a word in terms of suitable generators. | ||
|
||
The recognition tree has enough information to decide whether a group element | ||
is an element of the given group, | ||
and if yes to write the element as a word in terms of suitable generators | ||
of the given group. | ||
|
||
```@docs | ||
recognize | ||
is_ready | ||
nice_gens | ||
straight_line_program(tree::GroupRecognitionTree, g::GAPGroupElem) | ||
``` |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.