arxiv: 2604.17462 · v1 · submitted 2026-04-19 · 🧮 math.GR · math.QA

Recognition: unknown

Complete Isocategorical Classification of Groups of Order 64 via GAP

Shoki Sato

Pith reviewed 2026-05-10 05:07 UTC · model grok-4.3

classification 🧮 math.GR math.QA

keywords group classificationmonoidal equivalenceisocategorical groupsrepresentation categoriesGAP computationorder 64finite groupsquantum groups

0 comments

The pith

Groups of order 64 are now fully classified by monoidal equivalence of their representation categories, with exactly two pairs of non-isomorphic isocategorical groups.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a complete classification of all groups of order 64 according to whether their representation categories are monoidally equivalent. Earlier work covered all smaller orders, but order 64 had only partial examples until now. The authors wrote custom routines in GAP to check the 267 groups in the standard library and produce the full list of equivalence classes. A reader would care because monoidal equivalence identifies groups that give the same finite quantum group structure. The result closes the classification problem for groups up to this size.

Core claim

By developing an original computational approach using GAP, the complete classification for groups of order 64 is achieved, demonstrating that there exist exactly two pairs of non-isomorphic isocategorical groups of this order.

What carries the argument

Custom GAP routines that implement checks for monoidal equivalence of representation categories across the library of all groups of order 64.

If this is right

The monoidal classification is now complete for every group whose order is at most 64.
Exactly two pairs of non-isomorphic groups of order 64 have monoidally equivalent representation categories.
All other groups of this order produce representation categories that are monoidally inequivalent to each other.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same computational strategy could be applied to groups of order 128 or higher once the group libraries and equivalence checks are scaled.
The scarcity of isocategorical pairs at order 64 suggests that monoidal equivalence becomes rarer as group order grows.
The explicit list of equivalence classes supplies concrete data for studying the corresponding tensor categories or Hopf algebras.

Load-bearing premise

The custom GAP routines correctly implement the definition of monoidal equivalence of representation categories and the built-in library of groups of order 64 is exhaustive and correctly labeled.

What would settle it

An independent implementation of the monoidal-equivalence check run on the full list of 267 groups of order 64 that returns a different count of isocategorical pairs or identifies different pairs.

read the original abstract

The classification of finite groups under monoidal equivalence is a fundamental topic in the study of finite quantum groups. While a complete classification has been established for all groups of order strictly less than 64, the case for order 64 has remained limited to the construction of specific examples. In this study, we achieve the complete classification for groups of order 64 by developing an original computational approach using GAP. We describe our methodology and demonstrate that there exist exactly two pairs of non-isomorphic isocategorical groups of this order.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper finishes the isocategorical classification up to order 64 by reporting exactly two pairs, but the count rests on unverified custom GAP code for monoidal equivalence.

read the letter

The authors ran through the complete list of groups of order 64 and found exactly two pairs of non-isomorphic groups whose representation categories are monoidally equivalent. This supplies the last missing case after earlier work had handled everything smaller and only produced scattered examples at 64. That concrete count is the new piece of information the paper adds. They describe the custom GAP routines they wrote to perform the checks, which is more transparent than simply stating a result. The SmallGroups library itself is standard and reliable for the input data. The soft spot is verification. The equivalence decision depends on their original code, and the abstract and description give no sign that the routines were released, cross-checked against another system, or tested on known smaller-order cases with independent methods. A small error in how fusion rules, associators, or unitors are encoded would directly change the reported number of pairs. Without that check, the result stays provisional even if the overall approach is reasonable. This work is aimed at people in quantum groups and fusion categories who need the full list up to 64 for reference or further constructions. A reader in that subfield can extract the final number and the pairs themselves. I would send it to peer review so referees can examine the code and ask for explicit verification steps on the two pairs. The claim is narrow enough that a careful check is feasible and worthwhile.

Referee Report

1 major / 0 minor

Summary. The manuscript claims to complete the isocategorical classification of all groups of order 64 by means of an original GAP-based computational procedure. It reports that exactly two pairs of non-isomorphic groups of this order have monoidally equivalent representation categories.

Significance. If the custom GAP routines correctly implement the definition of monoidal equivalence of representation categories, the result would complete the classification for all groups of order at most 64 and supply a concrete, exhaustive count of isocategorical pairs. The computational enumeration approach itself is a strength when the predicate is independently verifiable.

major comments (1)

[Methodology / computational approach] The description of the custom GAP routines used to decide monoidal equivalence (including handling of associators, unitors, and fusion data) is insufficient to permit independent verification or reproduction. This is load-bearing for the central claim, as the reported count of exactly two pairs rests entirely on the correctness of the implemented predicate.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their positive evaluation of the significance of completing the isocategorical classification for groups of order 64 and for the constructive comment on our computational methodology. We address the major comment in detail below and have revised the manuscript to strengthen the presentation of our GAP implementation.

read point-by-point responses

Referee: The description of the custom GAP routines used to decide monoidal equivalence (including handling of associators, unitors, and fusion data) is insufficient to permit independent verification or reproduction. This is load-bearing for the central claim, as the reported count of exactly two pairs rests entirely on the correctness of the implemented predicate.

Authors: We agree that the original description of the custom GAP routines was too brief to support full independent verification. In the revised manuscript we have expanded the methodology section with explicit pseudocode for the monoidal-equivalence decision procedure, step-by-step accounts of how associators, unitors and fusion data are computed and checked inside GAP, and a description of the validation steps performed against all groups of order less than 64 (where the classification is already known). The complete, self-contained GAP code has also been deposited as supplementary material with the arXiv submission. These additions make the predicate fully reproducible and allow direct confirmation of the reported count of exactly two pairs. revision: yes

Circularity Check

0 steps flagged

Computational enumeration with independent verification path

full rationale

The paper performs an exhaustive computational classification of the 267 groups of order 64 using the SmallGroups library and custom GAP routines to test monoidal equivalence of representation categories. No derivation chain, fitted parameters, or self-citation is invoked to obtain the count of two isocategorical pairs; the result is obtained by direct enumeration against an external, independently checkable database and predicate. The methodology is described in the text and can be reproduced or falsified by running equivalent code, satisfying the self-contained criterion with no reduction of outputs to inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The classification rests on the standard definition of monoidal equivalence of representation categories and on the completeness of GAP's SmallGroups library; no free parameters or new entities are introduced.

axioms (2)

domain assumption The built-in GAP library contains every group of order 64 up to isomorphism.
Invoked when the computation enumerates all groups of that order.
domain assumption Monoidal equivalence of representation categories can be decided by a finite algorithm implementable in GAP.
Required for the computational check to be exhaustive.

pith-pipeline@v0.9.0 · 5369 in / 1229 out tokens · 46830 ms · 2026-05-10T05:07:17.803493+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

8 extracted references · 1 canonical work pages

[1]

Brown.Cohomology of Groups

K.S. Brown.Cohomology of Groups. Graduate Texts in Mathematics. Springer New York, 2012

2012
[2]

Etingof and S

P. Etingof and S. Gelaki. Isocategorical groups, 2000

2000
[3]

The GAP Group.GAP – Groups, Algorithms, and Programming, Version 4.14.0, 2024

2024
[4]

Goyvaerts and E

I. Goyvaerts and E. Meir. The witt group of a braided monoidal category. arXiv:1412.3417 [math.KT], 2014

work page arXiv 2014
[5]

Izumi and H

M. Izumi and H. Kosaki. On a subfactor analogue of the second cohomology.Reviews in Mathematical Physics, 14(7–8):733–757, 2002

2002
[6]

Neshveyev and L

S. Neshveyev and L. Tuset.Compact quantum groups and their representation categories. Cours sp´ ecialis´ es, 20. Soci´ et´ e Math´ ematique de France, Paris, 2013

2013
[7]

K. Shimizu. Monoidal morita invariants for finite group algebras.Journal of Algebra, 323(2):397–418, 2010

2010
[8]

Wassermann

A. Wassermann. Ergodic actions of compact groups on operator algebras: I. General theory. Annals of Mathematics, 130(2):273–319, 1989. Department of Mathematics, W aseda University, Tokyo 169-8050, JAPAN Email address:barley-tea-3416@moegi.waseda.jp 170

1989