The groups of order at most 2000
From MaRDI portal
Publication:2761160
DOI10.1090/S1079-6762-01-00087-7zbMath0986.20024OpenAlexW1649168892MaRDI QIDQ2761160
Hans Ulrich Besche, E. A. O'Brien, Bettina Eick
Publication date: 17 December 2001
Published in: Electronic Research Announcements of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222820
Arithmetic and combinatorial problems involving abstract finite groups (20D60) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items (18)
Groups of order $p^8$ and exponent $p$ ⋮ Constructing Groups of ‘Small’ Order: Recent Results and Open Problems ⋮ One Class Genera of Lattice Chains Over Number Fields ⋮ Unnamed Item ⋮ Chirality and symmetry breaking in a discrete internal space ⋮ The construction of finite solvable groups revisited. ⋮ The non-commuting, non-generating graph of a non-simple group ⋮ On regular polytopes of 2-power order ⋮ Stronger arithmetic equivalence ⋮ Cayley’s Theorem Revisited: Embeddings of Small Finite Groups ⋮ The non-commuting, non-generating graph of a nilpotent group ⋮ Generation of groups of square-free order. ⋮ Unnamed Item ⋮ The cyclic graph (deleted enhanced power graph) of a direct product ⋮ One-class genera of exceptional groups over number fields ⋮ Strongly Real Beauville Groups ⋮ Rationality of twists of the Siegel modular variety of genus 2 and level 3 ⋮ EXTENDING RESULTS OF MORGAN AND PARKER ABOUT COMMUTING GRAPHS
Uses Software
Cites Work
- Construction of finite groups
- Computing chief series, composition series and socles in large permutation groups
- The \(p\)-group generation algorithm
- THE GROUPS OF ORDER qn· p
- Enumerating p -Groups. I: Inequalities
- A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
- Enumerating p -Groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The groups of order at most 2000
