Congruence networks for completely simple semigroups
Mario Petrich · Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics · 1994
Abstract 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.