paper

-congruences on -inverse monoids

arXiv:2608.15114

Abstract

We study the class of congruences on -inverse monoids that respect the unary operation $a\mapsto\mx{a}$, assigning to each element the maximum element of its -class, which we refer to as -congruences. We characterize kernel normal systems and congruence pairs on -inverse monoids which give rise to such congruences and establish a number of further related results including a classification of -congruence-free -inverse monoids.

12 pages