{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreie3wtkxre6bne4k7iziupvr24bfoe6bzcq6p7jb3lxiagesoeyeqy",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mf4al6hkto72"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2602.15497v1",
  "publishedAt": "2026-02-18T01:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Saveliy V. Skresanov"
  ],
  "textContent": "**Authors:** Saveliy V. Skresanov\n\nThe group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism of arbitrary groups of order $ n $ has time complexity $ n^{O(\\log n)} $. We consider the group isomorphism problem for some extensions of abelian groups by $ k $-generated groups for bounded $ k $. In particular, we prove that one can decide isomorphism of abelian-by-cyclic extensions in polynomial time, generalizing a 2009 result of Le Gall for coprime extensions. As another application, we give a polynomial-time isomorphism test for abelian-by-simple group extensions, generalizing a 2017 result of Grochow and Qiao for central extensions. The main novelty of the proof is a polynomial-time algorithm for computing the unit group of a finite ring, which might be of independent interest.",
  "title": "Polynomial-time isomorphism test for $k$-generated extensions of abelian groups"
}