In this release some new features have been added and some issues have been resolved. The new features in this version of libsemigroups were implemented by Reinis Cirpons, J. D. Mitchell, and Finn Smith.
The major new feature in this release is:
- an implementation of the Konieczny-Lallement-McFadden Algorithm for computing finite semigroups (Finn Smith and J. D. Mitchell).
The major improvements in this release are:
- an improvement to the
is_obviously_infinitefunction for congruences, and finitely presented semigroups and monoids. Whenlibsemigroupsis compiled witheigenenabled (as it is by default), then an integer matrix can be associated to a finite presentation, if this matrix does not have full rank, then the associated finitely presented semigroup or monoid is infinite.eigenis used to perform the computation of the rank of this matrix if available (Reinis Cirpons and J. D. Mitchell). - the time it takes to compile
libsemigroupshas be reduced.