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

ENHANCE: Special redispatch for Nat.Hom.ByNS if group is found out to be finite #3075

Merged
merged 1 commit into from
Dec 2, 2018
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 18 additions & 0 deletions lib/factgrp.gi
Original file line number Diff line number Diff line change
Expand Up @@ -1151,6 +1151,9 @@ function(G,N)
return GenericFindActionKernel(G,N);
end);

RedispatchOnCondition(FindActionKernel,IsIdenticalObj,[IsGroup,IsGroup],
[IsGroup and IsFinite,IsGroup],0);

InstallMethod(FindActionKernel,"general case: can't do",IsIdenticalObj,
[IsGroup,IsGroup],0,
function(G,N)
Expand Down Expand Up @@ -1400,6 +1403,12 @@ local h;
fi;
if h=fail then
# now we try to find a suitable operation

# redispatch upon finiteness test, as following will fail in infinite case
if not HasIsFinite(G) and IsFinite(G) then
return NaturalHomomorphismByNormalSubgroupOp(G,N);
fi;

h:=FindActionKernel(G,N);
if h<>fail then
Info(InfoFactor,1,"Action of degree ",
Expand All @@ -1415,6 +1424,15 @@ local h;
return h;
end);

RedispatchOnCondition(NaturalHomomorphismByNormalSubgroupNCOrig,IsIdenticalObj,
[IsGroup,IsGroup],[IsGroup and IsFinite,IsGroup],0);

RedispatchOnCondition(NaturalHomomorphismByNormalSubgroupInParent,true,
[IsGroup],[IsGroup and IsFinite],0);

RedispatchOnCondition(FactorGroupNC,IsIdenticalObj,
[IsGroup,IsGroup],[IsGroup and IsFinite,IsGroup],0);

#############################################################################
##
#M NaturalHomomorphismByNormalSubgroup( <G>, <N> ) . . for solvable factors
Expand Down
5 changes: 5 additions & 0 deletions tst/testbugfix/2018-12-01-Nathom.tst
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
# Reported in github PR 3070
# Degenerate example where the subgroup can be formed without finiteness test (as the group
# is cyclic).
gap> G := Group([[[E(3),0,0],[0,E(3),0],[0,0,E(3)]],[[1,0,0],[0,0,1],[0,1,0]]]);;
gap> FactorGroup(G,Center(G));;