Congruence lattices of finite diagram monoids (Q1649355)

The authors obtained insights for the results presented here from computational experiments with the computer algebra system GAP. These experiments showed that the congruence lattices of diagram monoids have a much richer structure than several similar (known) structures, e.g., the congruence lattices of the full transformation monoid or of the symmetric inverse monoid. This helped to concentrate on essential attributes of partitions (transversal, (co)domain, (co)kernel, rank) and to develop a formal framework involving ideals, normal subgroups and retractions which yielded a complete description of the congruence lattices of several types of finite diagram monoids: the partition monoid, the planar partition monoid, the Brauer monoid, the Jones monoid (also called Temperley-Lieb monoid), the Motzkin monoid and the partial Brauer monoid.