Skip to content

Allow factorizing permutations into words in somewhat larger examples #5854

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.

Sign up for GitHub

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

Open
fingolfin wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Allow factorizing permutations into words in somewhat larger examples #5854

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
6 changes: 3 additions & 3 deletions lib/ghomperm.gi
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -794,12 +794,12 @@ BindGlobal("DoSCMPermGpHom",function(arg)
if maxstor>65535 then
maxstor:=maxstor*2; # perms need twice as much memory
fi;
maxstor:=Int(40*1024^2/maxstor); # allocate at most 40MB to the perms
maxstor:=Int(80*1024^2/maxstor); # allocate at most 80MB to the perms
# but don't be crazy
maxstor:=Minimum(maxstor,
Size(Source(hom))/10,
500*LogInt(Size(Source(hom)),2),
25000);
1500*LogInt(Size(Source(hom)),2),
400000);

# fill transversal with elements that are short words
# This is similar to Minkwitz' approach and produces much shorter
Expand Down