Classifying uniformly generated groups

S. P. Glasby

doi:10.1080/00927872.2019.1632333

Classifying uniformly generated groups

S. P. Glasby

Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

229 Downloads (Pure)

Abstract

A finite group G is called uniformly generated, if whenever there is a (strictly ascending) chain of subgroups then d is the minimal number of generators of G. 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.

Original language	English
Pages (from-to)	101-104
Number of pages	4
Journal	Communications in Algebra
Volume	48
Issue number	1
Early online date	7 Jul 2019
DOIs	https://doi.org/10.1080/00927872.2019.1632333
Publication status	Published - 2 Jan 2020

Access to Document

10.1080/00927872.2019.1632333

Glasby S.P., 2019 Classifying uniformly generated groupsSubmitted manuscript, 107 KB

Complexity of group algorithms and statistical fingerprints of groups
Praeger, C. (Investigator 01) & Niemeyer, A. (Investigator 02)
ARC Australian Research Council
21/02/19 → 31/12/22
Project: Research
Permutation groups: factorisations, structure and applications
Giudici, M. (Investigator 01) & Praeger, C. (Investigator 02)
ARC Australian Research Council
1/01/16 → 2/02/19
Project: Research

Cite this

@article{64bcd18fc90b46758d060c377e71f87c,

title = "Classifying uniformly generated groups",

abstract = "A finite group G is called uniformly generated, if whenever there is a (strictly ascending) chain of subgroups then d is the minimal number of generators of G. 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 = "Length, depth, irredundant, subgroup chain, SUBGROUPS",

author = "Glasby, {S. P.}",

year = "2020",

month = jan,

day = "2",

doi = "10.1080/00927872.2019.1632333",

language = "English",

volume = "48",

pages = "101--104",

journal = "Communications in Algebra",

issn = "0092-7872",

publisher = "Taylor & Francis",

number = "1",

}

TY - JOUR

T1 - Classifying uniformly generated groups

AU - Glasby, S. P.

PY - 2020/1/2

Y1 - 2020/1/2

N2 - A finite group G is called uniformly generated, if whenever there is a (strictly ascending) chain of subgroups then d is the minimal number of generators of G. 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.

AB - A finite group G is called uniformly generated, if whenever there is a (strictly ascending) chain of subgroups then d is the minimal number of generators of G. 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.

KW - Length

KW - depth

KW - irredundant

KW - subgroup chain

KW - SUBGROUPS

U2 - 10.1080/00927872.2019.1632333

DO - 10.1080/00927872.2019.1632333

M3 - Article

SN - 0092-7872

VL - 48

SP - 101

EP - 104

JO - Communications in Algebra

JF - Communications in Algebra

IS - 1

ER -

Classifying uniformly generated groups

Abstract

Access to Document

Fingerprint

Projects

Complexity of group algorithms and statistical fingerprints of groups

Permutation groups: factorisations, structure and applications

Cite this