Computing 3-Dimensional Groups : Crossed Squares and Cat$^2$-Groups
Zekeriya Arvasi, Alper Odaba\c{s}, Christopher D. Wensley

TL;DR
This paper explores the computational aspects of 3-dimensional algebraic structures called crossed squares and cat$^2$-groups, providing algorithms, implementation details, and extensive classification data.
Contribution
It introduces algorithms for computing with crossed squares and cat$^2$-groups, and provides a classification of 1,000 isomorphism classes up to order 30.
Findings
Algorithms for computing with crossed squares and cat$^2$-groups are detailed.
A comprehensive table of 1,000 isomorphism classes up to order 30.
Implementation in the GAP package $ extsf{XMod}$ is described.
Abstract
The category of crossed squares is equivalent to the category of cat-groups. Functions for computing with these structures have been developed in the package written using the computational discrete algebra programming language. This paper includes details of the algorithms used. It contains tables listing the isomorphism classes of cat-groups on groups of order at most .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Geometric and Algebraic Topology · graph theory and CDMA systems
