No label defined (Q3972452)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 15803
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 15803

      Statements

      0 references
      0 references
      0 references
      25 June 1992
      0 references
      generators
      0 references
      relators
      0 references
      rank of the Schur multiplier
      0 references
      finite groups
      0 references
      finite presentations
      0 references
      deficiency
      0 references
      dihedral group
      0 references
      direct power
      0 references
      deficiency zero group
      0 references
      [For the entire collection see Zbl 0706.00012.] Continuing their work on the efficiency of \(PSL(2,p)\times PSL(2,p),p\) prime, the authors prove three theorems. But first, some definitions. A finite group \(G\) is efficient if \(G\) has a presentation with \(d\) generators and \(r\) relators where \(r-d\) is the rank of the Schur multiplier \(M(G)\) of \(G\). It was shown by Schur that the number of relators for any group \(G\) with \(d\) generators is at least \(d+\hbox{rank}(M(G))\). Furthermore, Swan has shown not all finite groups are efficient. The minimum of \(r-d\) taken over all finite presentations of \(G\) is termed the deficiency of \(G\) (denoted \(\hbox{def}(G))\). Thus \(G\) is efficient if \(\hbox{def}(G)=\hbox{rank}(M(G))\). The authors prove the following Theorem 1. Let \(D_{2m}\) be the dihedral group of order \(2m\). Then for all \(n,m\geq 1,D^ n_{2m}\) is efficient. (\(D_{2m}^ n\) is the \(n\)th direct power of \(D_{2m}\).) Theorem 2. For all odd \(m\), \(D_{2m}^ 2\) has a covering group which is efficient and is a finite deficiency zero group. Theorem 3. The direct cube \(PSL(2,5)^ 3\) is efficient.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references