Isomorphism testing of groups of cube-free order

Heiko Dietrich, James B Wilson

Research output: Contribution to journalArticleResearchpeer-review

Abstract

A group G has cube-free order if no prime to the third power divides |G|. We describe an algorithm that given two cube-free groups G and H of known order, decides whether G≅H, and, if so, constructs an isomorphism G→H. If the groups are input as permutation groups, then our algorithm runs in time polynomial in the input size, improving on the previous super-polynomial bound. An implementation of our algorithm is provided for the computer algebra system GAP.

Original languageEnglish
Number of pages19
JournalJournal of Algebra
DOIs
Publication statusAccepted/In press - 13 Feb 2019

Keywords

  • Cube-free groups
  • Finite groups
  • Group isomorphisms

Cite this

@article{28e0d0cffaf3486b91ea2e2ea91d9b48,
title = "Isomorphism testing of groups of cube-free order",
abstract = "A group G has cube-free order if no prime to the third power divides |G|. We describe an algorithm that given two cube-free groups G and H of known order, decides whether G≅H, and, if so, constructs an isomorphism G→H. If the groups are input as permutation groups, then our algorithm runs in time polynomial in the input size, improving on the previous super-polynomial bound. An implementation of our algorithm is provided for the computer algebra system GAP.",
keywords = "Cube-free groups, Finite groups, Group isomorphisms",
author = "Heiko Dietrich and Wilson, {James B}",
year = "2019",
month = "2",
day = "13",
doi = "10.1016/j.jalgebra.2019.02.008",
language = "English",
journal = "Journal of Algebra",
issn = "0021-8693",
publisher = "Elsevier",

}

Isomorphism testing of groups of cube-free order. / Dietrich, Heiko; Wilson, James B.

In: Journal of Algebra, 13.02.2019.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Isomorphism testing of groups of cube-free order

AU - Dietrich, Heiko

AU - Wilson, James B

PY - 2019/2/13

Y1 - 2019/2/13

N2 - A group G has cube-free order if no prime to the third power divides |G|. We describe an algorithm that given two cube-free groups G and H of known order, decides whether G≅H, and, if so, constructs an isomorphism G→H. If the groups are input as permutation groups, then our algorithm runs in time polynomial in the input size, improving on the previous super-polynomial bound. An implementation of our algorithm is provided for the computer algebra system GAP.

AB - A group G has cube-free order if no prime to the third power divides |G|. We describe an algorithm that given two cube-free groups G and H of known order, decides whether G≅H, and, if so, constructs an isomorphism G→H. If the groups are input as permutation groups, then our algorithm runs in time polynomial in the input size, improving on the previous super-polynomial bound. An implementation of our algorithm is provided for the computer algebra system GAP.

KW - Cube-free groups

KW - Finite groups

KW - Group isomorphisms

UR - http://www.scopus.com/inward/record.url?scp=85061613975&partnerID=8YFLogxK

U2 - 10.1016/j.jalgebra.2019.02.008

DO - 10.1016/j.jalgebra.2019.02.008

M3 - Article

JO - Journal of Algebra

JF - Journal of Algebra

SN - 0021-8693

ER -