Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Minimal Permutation Degree for Simple and Semi-Simple Groups #5732

Open
wants to merge 12 commits into
base: master
Choose a base branch
from
Open
5 changes: 5 additions & 0 deletions lib/grplatt.gd
Original file line number Diff line number Diff line change
Expand Up @@ -535,6 +535,9 @@ DeclareSynonym("EmbeddingConjugates",ContainingConjugates);
## positive integer <M>n=\mu(G)</M> such that <A>G</A> is isomorphic to a
## subgroup of the symmetric group of degree <M>n</M>.
## This can require calculating the whole subgroup lattice.
## In case you know that <A>G</A> is simple or semi-simple, you can use
## <C>MinimalFaithfulPermutationDegreeOfSimpleGroup</C> and
## <C>MinimalFaithfulPermutationDegreeOfSemiSimpleGroup</C> instead.
## The operation
## <Ref Oper="MinimalFaithfulPermutationRepresentation"/>
## returns a
Expand All @@ -556,6 +559,8 @@ DeclareSynonym("EmbeddingConjugates",ContainingConjugates);
DeclareOperation("MinimalFaithfulPermutationDegree",[IsGroup and IsFinite]);
DeclareOperation("MinimalFaithfulPermutationRepresentation",
[IsGroup and IsFinite]);
DeclareGlobalFunction("MinimalFaithfulPermutationDegreeOfSimpleGroup");
DeclareGlobalFunction("MinimalFaithfulPermutationDegreeOfSemiSimpleGroup");

#############################################################################
##
Expand Down
Loading