gap-system / gap / 10674 / 9
85%
master: 4%

LAST BUILD BRANCH: mh/stable-4.10-GAPARCH
DEFAULT BRANCH: master
Ran
Files 635
Run time 33s
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst
coverage: 60.493% (-0.06%) from 60.557%
TEST_SUITES=testbugfix CONFIGFLAGS="--enable-memory-checking"

push

travis-ci

fingolfin 
Irreducible Modules and Permutation Representations (#3616)

* ENHANCE: Count IrreducibleModules expected

so tensoring can stop if needed. Also factor out pcore.

* ENHANCE: Test example for harder isomorphism

* ENHANCE: Strategy improvement for factor groups

Try to get extisting, stored, factor if OK.

Also added function to provide method analog to
LargerQuotientBySubgroupAbelianization.

Remove forced test to hope to get calculation to finish on Travis

* ENHANCE: Descending subgroups iterator now goes properly

Allow option to skip over larger steps, not getting every subgroup.

* ENHANCE: Improvements to constructing extensions in permrep

Simplify presentation only if requested by option to reduce the chance of
subgroup abelianization breaking b/c of too large coefficient in kernel code.

Try subgroup search in Sylow quotient to help finding permutation
representation.

FpGroupCocyle does not simplify as the rewritten presentation ends up worse.

If the index gets larger do not rewrite, but build an fp version of the
subgroup through the cocycle.

Reduce degree obtained immediately by blocks.

Also changed print levels and include new test
But also Removed `forcetest` test as it is too slow

* ENHANCE: LargerQuotientBySubgroupAbelianization

will not calculate subgroup lattice, but uses normal form to find a maximal
subgroup that intersects trivially, respectively subgroup that does not
contain.

174427 of 288344 relevant lines covered (60.49%)

2761571.19 hits per line

Source Files on job 10674.9 (TEST_SUITES=testbugfix CONFIGFLAGS="--enable-memory-checking")