中文

Finite groups with a certain number of elements pairwise generating a non-nilpotent subgroup

群论 2007-05-23 v1

摘要

Let n>0n>0 be an integer and X\mathcal{X} be a class of groups. We say that a group GG satisfies the condition (X,n)(\mathcal{X},n) whenever in every subset with n+1n+1 elements of GG there exist distinct elements x,yx,y such that <x,y><x,y> is in X\mathcal{X}. Let N\mathcal{N} and A \mathcal{A} be the classes of nilpotent groups and abelian groups, respectively. Here we prove that: (1) If GG is a finite semi-simple group satisfying the condition (N,n)(\mathcal{N},n), then G<c2[log21n]n2[log21n]!|G|<c^{2[\log_{21}n]n^2} [\log_{21}n]!, for some constant cc. (2) A finite insoluble group GG satisfies the condition (N,21)(\mathcal{N},21) if and only if GZ(G)A5\frac{G}{Z^*(G)}\cong A_5, the alternating group of degree 5, where Z(G)Z^*(G) is the hypercentre of GG. (3) A finite non-nilpotent group GG satisfies the condition (N,4)(\mathcal{N}, 4) if and only if GZ(G)S3\frac{G}{Z^*(G)}\cong S_3, the symmetric group of degree 3. (4) An insoluble group GG satisfies the condition (A,21)(\mathcal{A},21) if and only if GZ(G)×A5G\cong Z(G)\times A_5, where Z(G)Z(G) is the centre of GG. (5) If dd is the derived length of a soluble group satisfying the condition (A,n)(\mathcal{A},n), then d=1d=1 if n{1,2}n\in \{1,2\} and d2n3d\leq 2n-3 if n2n\geq 2.

关键词

引用

@article{arxiv.math/0511667,
  title  = {Finite groups with a certain number of elements pairwise generating a non-nilpotent subgroup},
  author = {Alireza Abdollahi and Aliakbar Mohammadi Hassanabadi},
  journal= {arXiv preprint arXiv:math/0511667},
  year   = {2007}
}

备注

Published in Bulletin of the Iranian Mathematical Society, Vol. 30 No. 2 (2004), pp. 1-20