Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 17 min ago
PreprintarXiv licencearXiv

A classification of finite simply reducible groups of order at most 2000

Abstract

We give a computer-assisted classification, up to isomorphism, of all nontrivial finite simply reducible groups of order at most 2000. There are 7889 such groups, all of even order. We provide representatives and a table of their numbers at each order. Order 1024, which is not available as a catalogue of group objects in the SmallGroups library of the computer algebra system GAP, requires a separate construction. Combining descendant generation with a classification of quadratic maps over 𝔽2, we obtain exactly 803 groups of this order, including 221 of nilpotency class two. We also derive exact counting formulas on several infinite families of orders and explicit bounds from structural subclasses.

Related

  1. Infinitely many finite simple groups of Lie type are not generated invariably by two elements of prime order
    Robert M. Guralnick, John Shareshian, Russ Woodroofe
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. On the mapping class groups of simply connected smooth 4-manifolds
    David Baraglia
    Algebraic & Geometric TopologyPeer-reviewedCC BYFull text13 citedGeometry & topologyOpenAlex
  3. Finite groups whose proper subgroups of order divisible by p are supersolvable
    Antonio Beltrán, Fernando Viudez
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. On Finite Groups with Element Order Set of Width 3
    Eric Min, Chloe So, Yong Yang +3
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryarXiv
  5. Classification of anomalous actions of finite groups with the Rokhlin property
    Sergio Girón Pacheco, Gábor Szabó
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
BibTeX
@misc{luan2026classification,
  title = {{A classification of finite simply reducible groups of order at most 2000}},
  author = {Yongzhi Luan},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.17215},
  eprint = {2609.17215},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.17215},
}
RIS
TY  - UNPB
TI  - A classification of finite simply reducible groups of order at most 2000
AU  - Yongzhi Luan
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.17215
UR  - https://arxiv.org/abs/2609.17215
AB  - We give a computer-assisted classification, up to isomorphism, of all nontrivial finite simply reducible groups of order at most 2000. There are 7889 such groups, all of even order. We provide representatives and a table of their numbers at each order. Order 1024, which is not available as a catalogue of group objects in the SmallGroups library of the computer algebra system GAP, requires a separate construction. Combining descendant generation with a classification of quadratic maps over 𝔽_2, we obtain exactly 803 groups of this order, including 221 of nilpotency class two. We also derive exact counting formulas on several infinite families of orders and explicit bounds from structural subclasses.
ER  -