SearcharxivSearch

arXiv · math/0511667

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

Abstract

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

Explore related subjects

Keep this discovery

BibTeXRIS

Alireza Abdollahi, Aliakbar Mohammadi Hassanabadi. 2005-11-28. Finite groups with a certain number of elements pairwise generating a non-nilpotent subgroup. https://arxiv.org/abs/math/0511667

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR