scientific article; zbMATH DE number 1421029
The deficiency of a finite presentation \(\langle A\mid R\rangle\) with generators \(A\) and relations \(R\) is the number \(|R|-|A|\). It is well known that, for group presentations of finite groups, a lower bound for the deficiency is the rank of the second integral homology of the presented group. A similar result holds for monoid presentations of finite monoids and semigroup presentations of finite semigroups. A finite semigroup, monoid or group is called efficient when it admits, respectively, a semigroup, monoid or group presentation in which the deficiency attains the homological lower bound. The paper starts by showing that for a finite group, being efficient as a group or as a monoid are equivalent properties and goes on to study the efficiency of wreath products of finite groups. For instance, it is shown that the wreath product \(C_n\wr C_m\) of two finite cyclic groups is always efficient as a group but it is only proved to be efficient as a semigroup in case \(m\) is odd or both \(m\) and \(n\) are even, the remaining cases being left open. Further positive as well as some negative examples are also presented. An example of the latter is the result stating that, if \(G\) is a perfect finite group, \(H\) is a finite group with trivial second integral homology, and \(q\) is an odd integer, then \((C_q\times G)\wr H\) is inefficient. For the entire collection see [Zbl 0933.00033].
- On the efficiency of some wreath products of groups
- Wreath products and enlargements of groups
- On the isomorphism of wreath products of groups
- scientific article; zbMATH DE number 3948554
- scientific article; zbMATH DE number 6933
- scientific article; zbMATH DE number 3145254
- On wreath products of groups, semigroups and algebras
- Quantifying conjugacy separability in wreath products of groups
- Generalized wreath products of \(m\)-groups
- scientific article; zbMATH DE number 1963436
- Separability and efficiency under standard wreath product in terms of Cayley graphs.
- On the efficiency of some wreath products of groups
- Comparing semigroup and monoid presentations for finite monoids
- Knit products of some groups and their applications.
- On semigroup presentations and Adian graphs.
- On the efficiency of finite simple semigroups
- The semigroup efficiency of groups and monoids
- THE MAXIMALITY OF CERTAIN WREATH PRODUCTS IN ALTERNATING AND SYMMETRIC GROUPS
- The efficiency of standard wreath product
- Minimal Presentations and Embedding into Inefficient Semigroups
- A higher version of Zappa products for monoids
- On the Efficiency of the Direct Products of Monogenic Monoids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946052)