Tutorial - Computing with Semigroups in GAP
BibTeX
@MISC{Araújo_tutorial-,
author = {Isabel Araújo and Andrew Solomon},
title = {Tutorial - Computing with Semigroups in GAP},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
emigroups, and Rees matrix semigroups; 3. The power set semigroup will be of interest to potential GAP developers, showing how to create new types of multiplicative elements, and how to use finitely presented semigroups, semigroup homomorphisms and the built in Todd-Coxeter enumerator; 4. Endomorphisms of the symmetric group deals with selecting element representation for efficiency, moving between semigroups using isomorphisms, and studying semigroups whose elements are themselves homomorphisms; 5. The Heisenberg group showcases GAP's features for working with infinite finitely presented semigroups, such as the Knuth-Bendix procedure. 1 Endomorphisms of a finite chain In this section we use GAP to investigate the structure of O n , the semigroup of endomorphisms of a finite chain. The user will gain experience in working with: ffl transformation semigroups; ffl congruences and Rees congruences; ffl Green's relations, Green's classes and eggboxes. Consider the set [n] = f1; 2;
Citations
| 19 | of groups and monoids - Gilman - 1979 |
| 10 | Computation with Finitely Presented Groups, volume 48 of Encyclopedia of Mathematics and its Applications - Sims - 1994 |
| 5 | Presentations for two extensions of the monoid of order-preserving mappings on a finite chain - Arthur, Ruˇskuc |
| 3 | Computing transformation semigroups - Linton, Pfeiffer, et al. |
| 2 | The endomorphisms of a finite chain form a Rees congruence semigroup, Semigroup Forum 59 - Lavers, Solomon - 1999 |
| 2 | Semigroup enumeration -- computer implementation and applications - Walker - 1992 |
| 1 | The monoid of orientation preserving mappings on a chain. Semigroup Forum - Catarino, Higgins |
| 1 | Fibonacci numbers, ordered partitions, and transformations of a finite set - Lavers - 1994 |
