You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In stable-2.7 and unstable 3.0, IrreundantGeneratingSubset first checks whether there is only one generator; and returns it if so. It then takes the set of generators (sorts and removes duplicates) and now continues, assuming there are at least 2 generators.
If the generating set consists of a single generator repeated multiple times, then this assumption is wrong and the function ends up failing, as below:
gap> S := Semigroup([Transformation([1, 1]), Transformation([1, 1])]);
<transformation semigroup of degree 2 with 2 generators>
gap> IrredundantGeneratingSubset(S);
Error, Usage: cannot create a semigroup with no generators, at /Users/Wilf/GAP/lib/semigrp.gi:570 called from
Semigroup( Difference( gens, [ x ] )
I'll submit a pull request to fix this.
The text was updated successfully, but these errors were encountered:
IrreundantGeneratingSubset behaves incorrectly when given a
semigroup whose generating set consists of a single repeated
element.
Resolves: semigroups#160
wilfwilson
added a commit
to wilfwilson/Semigroups
that referenced
this issue
Apr 22, 2016
IrreundantGeneratingSubset behaves incorrectly when given a
semigroup whose generating set consists of a single repeated
element.
Resolves: semigroups#160
In
stable-2.7
andunstable 3.0
,IrreundantGeneratingSubset
first checks whether there is only one generator; and returns it if so. It then takes the set of generators (sorts and removes duplicates) and now continues, assuming there are at least 2 generators.If the generating set consists of a single generator repeated multiple times, then this assumption is wrong and the function ends up failing, as below:
I'll submit a pull request to fix this.
The text was updated successfully, but these errors were encountered: