Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T08:38:30.883Z Has data issue: false hasContentIssue false

Congruence networks for completely simple semigroups

Part of:Semigroups

Published online by Cambridge University Press:  09 April 2009

Mario Petrich
Affiliation:
Department of Mathematics, Simon Fraser University, Burnaby, B.C. V5A156, Canada
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The operators K, k, T and t are defined on the lattice of congruences on a Rees matrix semigroup S as follows. For ρ ∈ (S), ρK and ρk (ρT and ρt) are the greatest and the least congruences with the same kernel (trace) as ρ, respectively. We determine the semigroup generated by the operators K, k, T and t as they act on all completely simple semigroups. We also determine the network of congruences associated with a congruence ρ ∈ (S) and the lattice generated by it. The latter is then represented by generators and relations.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1994