SearcharxivSearch

arXiv · 2604.17462

Complete Isocategorical Classification of Groups of Order 64 via GAP

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Shoki Sato. 2026-04-19. Complete Isocategorical Classification of Groups of Order 64 via GAP. https://arxiv.org/abs/2604.17462

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR