Dear GAP forum,
Dr. Keith Briggs asked:
Does anybody know an efficient method for listing all presentations
of a given group with a given number of generators?
I am afraid without further specifications I do not understand the
A group has infinitely many presentations even with respect to a fixed
sequence of generators, (one can always add redundant relators) let
alone that e.g. an infinite group that can be generated by two elements
will trivially have infinitely many generating sequences consisting of
If 'efficient method for listing' is meant in some purely logical
sense of 'recursively enumerable' or the like, then the GAP-Forum is
not the place to ask the question, here we want to discuss questions
that in the end connect to practical computations, preferably in GAP.