On the power pseudovariety PCS.

From MaRDI portal
Publication:2248226



Abstract: Some new semantic and syntactic characterizations of the members of the power pseudovariety mathbfPCS are obtained. This leads in particular to new algorithms for deciding membership in mathbfPCS.


Let \(\mathbf{CS}\) stand for the pseudovariety of all finite completely simple semigroups and let \(\mathbf{PCS}\) be the pseudovariety generated by all power semigroups of the members of \(\mathbf{CS}\). The author proves that \(\mathbf{PCS}\) is equal to the Mal'cev product of the pseudovariety of all finite \(\mathcal J\)-trivial semigroups with \(\mathbf{CS}\), thus solving a problem raised by \textit{J. Kad'ourek} [Monatsh. Math. 166, No. 3-4, 411-440 (2012; Zbl 1255.20051)], and provides some other Mal'cev and semidirect decompositions for \(\mathbf{PCS}\) (Theorem~6) as well as various finite pseudoidentity bases for this pseudovariety (Theorem~8). These results yield transparent and efficient algorithms for deciding membership in \(\mathbf{PCS}\).











This page was built for publication: On the power pseudovariety \(\mathbf{PCS}\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248226)