On congruences on \(\mathcal T\)-regular semigroups. (Q958192)

A regular semigroup \(S\) with zero is called \(\mathcal T\)-regular if every interval of idempotents of \(S\) is a finite chain. The structure of \(\mathcal T\)-regular semigroups is described using trees of completely 0-simple semigroups. If \(C(S)\) is the congruence lattice of a \(\mathcal T\)-regular semigroup \(S\) and \(\rho\in C(S)\), then \(\ker\rho\) is the union of idempotent \(\rho\)-classes, \(\text{tr\,}\rho\) the restriction of \(\rho\) to the set of idempotents of \(S\). Binary relations \(K\), \(T\) on \(C(S)\) are defined by \(\lambda K\rho\Leftrightarrow\ker\lambda=\ker\rho\), \(\lambda T\rho\Leftrightarrow\text{tr\,}\lambda=\text{tr\,}\rho\). \(K\), \(T\)-classes are intervals, denoted \(\rho K=[\rho_K,\rho^K]\), \(\rho T=[\rho_T,\rho^T]\). The lattice of congruences of \(\mathcal T\)-regular semigroups is studied. Semigroups, for which the kernel relation is a congruence and semigroups for which the mappings \(\rho\to\rho_T\), \(\rho\to\rho^T\) are homomorphisms are characterized.