[Up] [Index]

1 Algorithms for Transformation Semigroups

TranSemi is the GAP 4 version of the GAP 3 package Monoid. It is still under development.

This package provides many specific methods for calculating with transformation semigroups. Most of the methods occlude the generic methods in the GAP 4.1 library, with notable exceptions listed below, which are only available in TranSemi.

  • DisplayTransformationSemigroup( S ) O

    Produces a convenient display of a transformation semigroup's DClass structure. Let S have degree n. Then for each r £ n, we show all D classes of rank n.

    A regular D class with a single H class of size 120 appears as

    *[H size = 120, 1 L classes, 1 R classes] 
    
    (the * denoting regularity).

    A non regular D class with singleton H classes, 15 L classes and 1 R class appears as:

    [H size = 1, 15 L classes (3 image types), 1 R classes (1 kernel types)]
    
    The "(3 image types)" means that each element of the D class has one of 3 different image sets and for each of the three image sets, there are 5 L classes with that image set.

  • GenSchutzenbergerGroup( G ) A

    This function unfolds the greens class G. It determines (and returns) the generalised Schutzenberger group of the representative of G.

    [Up] [Index]

    TranSemi manual
    May 2002