No label defined (Q3810002)

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 4079744
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4079744

      Statements

      0 references
      1987
      0 references
      van Kampen's lemma
      0 references
      generators
      0 references
      relations
      0 references
      continuum of non-isomorphic periodic 2-generated groups of exponent n
      0 references
      maximal subgroups
      0 references
      finitely generated simple groups
      0 references
      free Burnside group
      0 references
      B(m,n)
      0 references
      B(\(\infty ,n)\)
      0 references
      nontrivial group law
      0 references
      This paper is based on the works of Ol'shanskij who developed a geometric method of van Kampen's lemma for studying groups given by generators and many relations, in particular, groups of given (odd) exponent n. Several new important results are announced here without proof. Let n be an odd number greater than \(N=2\cdot 10^{77}\). Theorem 1: There exists a continuum of non-isomorphic periodic 2-generated groups of exponent n all of whose maximal subgroups are cyclic of order n. Earlier it was proved by \textit{S. Adyan} [in Dokl. Akad. Nauk SSSR 241, 745-748 (1978; Zbl 0416.20024)] that there exist at least countably many finitely generated simple groups of exponent \(\ell \cdot s\), where \(\ell\) is odd \(\geq 665\) and \(s>2\). The proof of theorem 1 follows the scheme of \textit{A. Ol'shanskij}'s from his paper [Algebra Logika 21, 553-618 (1982; Zbl 0524.20024)]. Corollary: the free Burnside group B(m,n) does not satisfy the min or max condition for normal subgroups for all odd \(n>N\). This was proved earlier by Adyan for \(m\geq 2\) and composite odd \(n\geq 665\) and for \(m\geq 66\) and odd \(n\geq 665.\) Theorem 2: For \(m\geq k\geq 2\) the group B(m,n) is completely approximated by B(k,n). Theorem 3: The group B(m,n) is completely approximated by 2- generated groups all of whose maximal subgroups are cyclic of order n. The proof of these results uses \textit{A. Ol'shanskij}'s [op.cit. and Mat. Sb., Nov. Ser. 118(160), 203-235 (1982; Zbl 0539.20020)]. Adyan proved that all finite or abelian subgroups of B(m,n) for odd \(n\geq 665\) are cyclic and that B(3,n) is imbeddable into B(2,n). Shirvanyan later proved that B(\(\infty,n)\) is imbeddable into B(3,n). For \(n>N\) the author strengthens this in Theorem 4: Each noncyclic subgroup of B(m,n) contains a subgroup isomorphic to B(\(\infty,n)\). Theorem 5: There exists a 2- generated simple group the orders of whose elements are unbounded and which satisfies a nontrivial group law. Theorem 6: There exists a continuum of non-isomorphic 2-generated simple torsion-free groups, which satisfies a nontrivial group law, all of whose proper subgroups are cyclic. The law in theorem 6 may be taken the same as Ol'shanskij's one giving a variety all of whose finite groups are abelian.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references