A FURTHER CLASS OF 3-GENERATOR, 3-RELATION FINITE GROUPS (Q2749066)

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 1663712
Language Label Description Also known as
default for all languages
No label defined
    English
    A FURTHER CLASS OF 3-GENERATOR, 3-RELATION FINITE GROUPS
    scientific article; zbMATH DE number 1663712

      Statements

      A FURTHER CLASS OF 3-GENERATOR, 3-RELATION FINITE GROUPS (English)
      0 references
      0 references
      21 February 2002
      0 references
      finitely presented groups
      0 references
      deficiency zero presentations
      0 references
      balanced presentations
      0 references
      minimal generating sets
      0 references
      finite metablian groups
      0 references
      Todd-Coxeter coset enumeration
      0 references
      Let \(G\) be a finitely presented group with presentation \(G=\langle x_1,x_2,\dots,x_n\mid r_1,r_2,\dots,r_m\rangle\). The deficiency of the presentation is defined to be \(n-m\). Presentations with \(n=m\) are called balanced or deficiency zero presentations. A group has deficiency zero if it has a balanced presentation on a minimal generating set. The class of groups \(G(n)\) defined by \(G(n)=\langle x,y,z\mid[x,y^{-1}]=z^2,\;[y,z]=x^n,\;[xy,xz]=y^{-2}\rangle\) where \(n\) is a given integer, is investigated here. It is proved that if \(m=|n|\) and \(n\) is even and \(n\neq 0,-2\), then \(G(n)\) is a finite metablian group of deficiency zero. The main tool of the investigation of the groups \(G(n)\) is the Todd-Coxeter coset enumeration algorithm.
      0 references

      Identifiers