The SimsRefinerIdeals class

For pruning the search tree when looking for congruences arising from right or two-sided ideals.

This class provides a pruner for pruning the search tree when looking for right or two-sided congruences arising from ideals (Rees congruences).

Contents

`SimsRefinerIdeals`	For pruning the search tree when looking for congruences arising from right or two-sided ideals.
`SimsRefinerIdeals.__call__`(…)	Check if a word graph can be extended to one defining a Rees congruence.
`SimsRefinerIdeals.init`(…)	Overloaded function.
`SimsRefinerIdeals.presentation`(…)	Get the presentation over which the refiner is defined.

Full API

class SimsRefinerIdeals

__init__(*args, **kwargs)

Overloaded function.

__init__(self: SimsRefinerIdeals, word: type) → None

This function returns an uninitialized SimsRefinerIdeals object that uses words of type specified by word.

Keyword Arguments:

word (type) – the type of words to use, must be list[int].

__init__(self: SimsRefinerIdeals, p: Presentation) → None

Construct from presentation.

This function constructs a SimsRefinerIdeals pruner for the semigroup or monoid defined by p.

Parameters:: p (Presentation) – A presentation.

__call__(self: SimsRefinerIdeals, wg: WordGraph) → bool

Check if a word graph can be extended to one defining a Rees congruence.

Returns False if there is no way of adding edges and nodes to wg which will result in a word graph defining a Rees congruence. Otherwise returns True.