English

Classifying uniformly generated groups

Group Theory 2019-05-31 v3

Abstract

A finite group GG is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups 1<x1<x1,x2<<x1,x2,,xd=G1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G, then dd is the minimal number of generators of GG. Our main result classifies the uniformly generated groups without using the simple group classification. These groups are related to finite projective geometries by a result of Iwasawa on subgroup lattices.

Keywords

Cite

@article{arxiv.1901.06480,
  title  = {Classifying uniformly generated groups},
  author = {S. P. Glasby},
  journal= {arXiv preprint arXiv:1901.06480},
  year   = {2019}
}

Comments

5 pages; 0 figures