Generation of groups of square-free order.
DOI10.1016/J.JSC.2007.01.006zbMATH Open1138.20001OpenAlexW2051934329MaRDI QIDQ2455751FDOQ2455751
Authors: Michael C. Slattery
Publication date: 26 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2007.01.006
Recommendations
- scientific article; zbMATH DE number 6963520
- On groups of squarefree order
- On The Number of Groups of Squarefree Order
- Finite groups with square-free element orders
- Finite groups with subgroup core factor orders free of squares.
- Generation of finite groups by nilpotent subgroups.
- On the groups of cube-free order.
- scientific article; zbMATH DE number 1560264
- On Elusive Permutation Groups of Square-Free Degree
- Generating groups by conjugation-invariant sets.
algorithmsnumbers of groupsgroups of square-free orderfinite group databasespower-conjugate presentations
Symbolic computation and algebraic computation (68W30) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)
Cites Work
Cited In (5)
Uses Software
This page was built for publication: Generation of groups of square-free order.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2455751)