arxiv: 2604.18346 · v1 · submitted 2026-04-20 · 🧮 math.CT · math.GR

Recognition: unknown

Implementing the biset category of finite groups

Fabian Zickgraf, Marc Talleux, Mohamed Barakat

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

classification 🧮 math.CT math.GR

keywords biset categoryfinite groupsKleisli categorycoequalizer completionSchreier-Sims algorithmCAP softwarealgorithmic category theorygroupoids

0 comments

The pith

The biset category of finite groups is implemented as a tower of standard categorical constructions in the CAP software.

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

The paper presents a software implementation of the category whose objects are finite groups and whose morphisms are bisets. It builds this category using a series of standard constructions from category theory, all realized in the CAP package for computational category theory. The key step is expressing the composition of bisets as the composition operation in a Kleisli category arising from a biadjunction monad. This in turn depends on realizing the universal property of the coequalizer completion of a group, treated as a groupoid with one object, and the implementation draws on the Schreier-Sims algorithm for orbit computations. If successful, the work makes the algebraic structure of bisets available for algorithmic manipulation.

Core claim

We describe an implementation of the biset category of finite groups as a tower of standard categorical constructions, all of which are implemented in the software project CAP for algorithmic category theory. In particular, we describe the composition of bisets as a composition in a Kleisli category of some biadjunction monad. This composition relies on the universal property of the coequalizer completion of a group viewed as a groupoid on one object. Implementing this universal property makes nontrivial use of the Schreier-Sims orbit algorithm.

What carries the argument

The Kleisli category of a biadjunction monad whose composition is realized via the universal property of the coequalizer completion of one-object groupoids, implemented using the Schreier-Sims orbit algorithm.

Load-bearing premise

The universal property of the coequalizer completion of a group as a one-object groupoid can be algorithmically realized using the Schreier-Sims orbit algorithm inside the existing CAP framework.

What would settle it

Running the implementation on two explicit bisets between small finite groups, such as the trivial biset and a regular biset on the cyclic group of order 3, and checking whether the computed composition matches the expected result from manual calculation or known formulas.

read the original abstract

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 gives a concrete CAP implementation of the biset category by stacking Kleisli categories and coequalizer completions, with Schreier-Sims supplying the algorithmic universal property.

read the letter

This paper turns the biset category into something you can compute inside CAP by modeling biset composition as Kleisli composition for a biadjunction monad whose coequalizer completion is handled by the Schreier-Sims orbit algorithm. That is the main deliverable: an explicit tower that makes the abstract universal property of one-object groupoids algorithmic rather than purely theoretical. The description is straightforward and sticks to standard categorical pieces already present in CAP, so the construction itself does not introduce exotic new machinery. If the wiring works, it gives group theorists and representation theorists a practical way to manipulate bisets without writing custom orbit code each time. The use of Schreier-Sims is a natural fit because the algorithm directly computes the orbits and stabilizers needed for the quotients that appear in the coequalizer universal property. The paper does a reasonable job laying out how the pieces fit together without overclaiming generality. The soft spot is the link between the categorical universal property and the concrete orbit calculations. The abstract asserts that Schreier-Sims implements the required coequalizers correctly, but without the full manuscript, examples, or code it is impossible to check whether the encoding of left and right actions, the extraction of the coequalizer morphisms, or the handling of stabilizers matches the biset tensor product exactly. A mismatch there would silently break the claimed equivalence even if the rest of the tower is standard. This is a specialized software-construction paper aimed at people already using CAP or working with bisets in fusion systems and representation theory. A reader who needs a computational handle on bisets will get direct value once the implementation is available and tested. It deserves a serious referee because the claim is concrete, the method is falsifiable against known biset examples, and the correctness question can be settled by inspecting the code and running small cases. I would send it to peer review with the expectation that reviewers will ask for the implementation details and verification examples.

Referee Report

2 major / 2 minor

Summary. The paper describes an implementation of the biset category of finite groups inside the CAP package for algorithmic category theory. Biset composition is realized as Kleisli composition for a biadjunction monad whose underlying construction uses the universal property of the coequalizer completion of a one-object groupoid; this universal property is implemented via a nontrivial application of the Schreier-Sims orbit algorithm.

Significance. If the claimed algorithmic realization is correct, the work supplies a concrete computational model for the biset category that re-uses standard categorical constructions already present in CAP. This could enable systematic computation with bisets and their compositions, which are relevant to representation theory and homotopy theory of groups. The explicit reduction of biset tensor product to a Kleisli composition and the integration of Schreier-Sims for a categorical universal property are the main technical contributions.

major comments (2)

[description of Kleisli composition and coequalizer completion] The central claim that Schreier-Sims orbit computations correctly realize the universal property of the coequalizer completion (and thereby biset composition) is not accompanied by an explicit, step-by-step account of how group actions, stabilizers, and orbits are encoded as the required coequalizer morphisms. Without this mapping, it is impossible to verify that the implementation matches the categorical definition.
[implementation section] No concrete examples, test cases, or verification against known biset compositions (e.g., for small groups such as cyclic or symmetric groups) are provided to demonstrate that the tower of constructions yields the expected category. This leaves the correctness of the overall implementation unconfirmed.

minor comments (2)

[early sections] Notation for the biadjunction monad and the Kleisli category could be introduced more explicitly with a diagram or a short table of the relevant functors and natural transformations.
[introduction] The manuscript would benefit from a brief comparison with existing computational approaches to bisets or groupoids in other systems (e.g., GAP or Sage).

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and the constructive comments. We address each major comment below and will revise the paper accordingly to improve verifiability.

read point-by-point responses

Referee: The central claim that Schreier-Sims orbit computations correctly realize the universal property of the coequalizer completion (and thereby biset composition) is not accompanied by an explicit, step-by-step account of how group actions, stabilizers, and orbits are encoded as the required coequalizer morphisms. Without this mapping, it is impossible to verify that the implementation matches the categorical definition.

Authors: We agree that the manuscript provides only a high-level description of the Schreier-Sims application and lacks an explicit step-by-step encoding of group actions, stabilizers, and orbits as coequalizer morphisms. In the revised version we will insert a dedicated subsection that details this mapping: for a group G viewed as a one-object groupoid, we will show how the orbit-stabilizer data produced by Schreier-Sims directly supplies the unique morphism from the coequalizer completion that satisfies the universal property used in the Kleisli composition for bisets. revision: yes
Referee: No concrete examples, test cases, or verification against known biset compositions (e.g., for small groups such as cyclic or symmetric groups) are provided to demonstrate that the tower of constructions yields the expected category. This leaves the correctness of the overall implementation unconfirmed.

Authors: We acknowledge that the current implementation section contains no explicit test cases. We will add a new subsection with concrete computations: for the cyclic group of order 2 and for S3 we will exhibit the bisets obtained via the Kleisli composition of the biadjunction monad, list the resulting morphisms in the coequalizer completion, and compare them with the manually computed biset compositions known from the literature on the biset category. revision: yes

Circularity Check

0 steps flagged

No circularity: software implementation of established categorical constructions

full rationale

The paper is a description of a software implementation in the CAP framework, constructing the biset category via a tower of standard categorical notions (Kleisli category of a biadjunction monad, coequalizer completion of a one-object groupoid) whose universal properties are realized algorithmically using the Schreier-Sims orbit algorithm. No equations, derivations, predictions, or first-principles results are claimed that could reduce to inputs by construction, self-definition, fitted parameters, or self-citation chains. The central claim is the correctness of the implementation mapping, which rests on external, independently verifiable category theory and group algorithms rather than any internal reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The implementation rests on the standard axioms of category theory (universal properties of coequalizers, monads, Kleisli categories) and the correctness of the Schreier-Sims algorithm for finite permutation groups; no new free parameters, ad-hoc axioms, or invented entities are introduced.

axioms (2)

standard math Universal properties of coequalizers and Kleisli categories hold in the category of sets and functions
Invoked when defining the coequalizer completion and the Kleisli composition for bisets.
standard math Schreier-Sims algorithm correctly computes orbits and stabilizers for finite permutation groups
Used to implement the universal property of the coequalizer completion.

pith-pipeline@v0.9.0 · 5373 in / 1497 out tokens · 37760 ms · 2026-05-10T03:03:17.302731+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

14 extracted references · 1 canonical work pages

[1]

2023 , eprint=

Biset functors for categories , author=. 2023 , eprint=

2023
[2]

On the Syntax and Semantics of

Gutsche, Sebastian and Posur, Sebastian and Skarts. On the Syntax and Semantics of. O. Hasan, M. Pfeiffer, G. D. Reis (eds.): Proceedings of the Workshop Computer Algebra in the Age of Types, Hagenberg, Austria, 17-Aug-2018 , publisher =. 2018 , url =

2018
[3]

Barakat, Mohamed and Gutsche, Sebastian and Skarts. The. 2015--2025 , url =

2015
[4]

2021 , printedkey =

List of doctrines in. 2021 , printedkey =

2021
[5]

2017--2026 , url =

Barakat, Mohamed and Mickisch, Julia and Zickgraf, Fabian , title =. 2017--2026 , url =

2017
[6]

2017--2026 , url =

Barakat, Mohamed and Mickisch, Julia and Talleux, Marc and Zickgraf, Fabian , title =. 2017--2026 , url =

2017
[7]

2022--2026 , url =

Barakat, Mohamed and Talleux, Marc , title =. 2022--2026 , url =

2022
[8]

2020--2026 , url =

Zickgraf, Fabian , title =. 2020--2026 , url =

2020
[9]

2024 , url =

Zickgraf, Fabian , title =. 2024 , url =

2024
[10]

2010 , publisher=

Biset Functors for Finite Groups , author=. 2010 , publisher=

2010
[11]

2014 , month =

Barakat, Mohamed and Lange-Hegermann, Markus , TITLE =. 2014 , month =

2014
[12]

2017 , url =

Gutsche, Sebastian , title =. 2017 , url =

2017
[13]

2019 , howpublished =

Gutsche, Sebastian and Posur, Sebastian , title =. 2019 , howpublished =

2019
[14]

Representations of

Posur, Sebastian , TITLE =. Representations of. 2021 , MRCLASS =. doi:10.1090/conm/769/15417 , NOTE =

work page doi:10.1090/conm/769/15417 2021