Computing with semigroups in GAP. -- A tutorial (Q2709032)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing with semigroups in GAP. -- A tutorial |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing with semigroups in GAP. -- A tutorial |
scientific article |
Statements
16 June 2002
0 references
computational semigroup theory
0 references
transformation semigroups
0 references
finitely presented semigroups
0 references
GAP
0 references
endomorphisms
0 references
Green relations
0 references
orientation preserving mappings
0 references
Rees matrix semigroups
0 references
homomorphisms
0 references
Computing with semigroups in GAP. -- A tutorial (English)
0 references
Possibilities to use the GAP (Groups, Algorithms, Programming) computational package (downloadable from \url{http://www.gap-system.org/gap/}) for investigating semigroup problems are illustrated using examples from the following areas: endomorphisms of a finite chain (transformation semigroups, congruences, Green relations), orientation preserving mappings (quotient semigroups, Rees matrix semigroups), power set semigroups (finitely presented semigroups, homomorphisms and enumerations), endomorphisms of the symmetric group (efficient representation of elements, semigroups of homomorphisms), the Heisenberg group (Knuth-Bendix procedure).NEWLINENEWLINEFor the entire collection see [Zbl 0954.00028].
0 references
