I know that GAP uses Todd-Coxeter algorithm to form the coset table of a group but there are multiple options while forming the table using this algorithm, so I was wondering if there is any way to access the exact algorithm GAP uses to for the command "LowIndexSubgroup(G,n)" .

I looked everywhere for this on GAP manual and github but could not find the exact complete algorithm.


1 Answer 1


LowIndexSubgroups for finitely presented groups uses the low-index algorithm, not the Todd-Coxeter algorithm. The implementation is essentially in the function DoLowIndexSubgroupsFpGroupIterator (and functions called by it) in lib/grpfp.gi, with some subroutines (tracing) in the kernel for performance reasons. It closely follows the low index algorithm as described in Section 5.4 of Holt/Eick/O'Brien, Handbook of Computational Group Theory.

  • $\begingroup$ Thank you very much! $\endgroup$ Sep 1, 2021 at 3:45

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .