An upper bound for the power pseudovariety PCS.
The author says that a finite semigroup \(S\) is an aggregate of block groups if \(aSb\) is a block group for all \(a,b\in S\). The class \(\mathbf{AgBG}\) of all aggregates of block groups is shown to constitute a pseudovariety of finite semigroups and to be defined by a single pseudoidentity. The author shows that \(\mathbf{AgBG}\) coincides with the Mal'cev product of the pseudovariety of all finite \(\mathcal J\)-trivial semigroups with the pseudovariety \(\mathbf{CS}\) of all finite simple semigroups (Corollary~3.3) and that the power pseudovariety \(\mathbf{PCS}\) of \(\mathbf{CS}\) is contained in \(\mathbf{AgBG}\) (Corollary 4.3). The question of whether the equality \(\mathbf{PCS}=\mathbf{AgBG}\) holds true is left open. Reviewer's remark: The equality \(\mathbf{PCS}=\mathbf{AgBG}\) has been then established by \textit{K.~Auinger} [``On the power pseudovariety \(\mathbf{PCS}\), Publ. Mat, Barc. 56, No. 2, 449-465 (2012; Zbl 1306.20058)].
- \(\mathbf{PG}=\mathbf{BG}\): redux
- A Conjecture on the Hall Topology for the Free Group
- A constructive version of the Ribes-Zalesskiĭ product theorem.
- A note on the equation \(\mathbf{PH}={\mathbf J}*{\mathbf H}\)
- A note on the power semigroup of a completely simple semigroup.
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- Categories as algebra: An essential ingredient in the theory of monoids
- Constructing divisions into power groups
- Finite aperiodic semigroups with commuting idempotents and generalizations
- Finite state automata: a geometric approach
- scientific article; zbMATH DE number 3869616 (Why is no real title available?)
- scientific article; zbMATH DE number 3552814 (Why is no real title available?)
- scientific article; zbMATH DE number 459360 (Why is no real title available?)
- scientific article; zbMATH DE number 1455132 (Why is no real title available?)
- scientific article; zbMATH DE number 798167 (Why is no real title available?)
- INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- Inverse automata and profinite topologies on a free group
- On power groups and embedding theorems for relatively free profinite monoids
- On The Profinite Topology on a Free Group
- POLYNOMIAL CLOSURE AND TOPOLOGY
- Reduction theorem for the type-II conjecture for finite monoids
- The geometry of profinite graphs with applications to free groups and finite monoids
- Varieties of finite supersolvable groups with the M.~Hall property.
This page was built for publication: An upper bound for the power pseudovariety \(\mathbf{PCS}\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q431180)