arxiv: 2605.03368 · v1 · submitted 2026-05-05 · 🧮 math.CT

Recognition: unknown

Double coset for groupoids

Keitaro Shiizuka

Pith reviewed 2026-05-09 16:38 UTC · model grok-4.3

classification 🧮 math.CT

keywords groupoidsdouble cosetsCauchy-Frobenius lemmaenumerationgroupoid actionslinear representationscategory theory

0 comments

The pith

The number of double cosets in a groupoid is given by an extension of the Cauchy-Frobenius lemma and by invariants in induced representations.

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

This paper develops methods to enumerate double cosets for groupoids rather than just groups. One method extends the Cauchy-Frobenius lemma by viewing double cosets as orbits of a groupoid acting on pairs of its elements. The other builds linear representations from the groupoid's action on the set of functions and counts the invariants under that action. These tools matter because groupoids capture symmetries that vary from object to object, as in many areas of algebra and topology, so counting their double cosets helps classify structures up to those variable symmetries.

Core claim

The central discovery is that double cosets of a groupoid admit enumeration formulas obtained by generalizing the Cauchy-Frobenius lemma to count orbits under the groupoid action and by computing the trace or dimension of fixed subspaces in the linear representation obtained from the action on functions.

What carries the argument

The double coset enumeration via the groupoid version of the Cauchy-Frobenius lemma and the associated linear representations of the groupoid.

If this is right

The number of orbits under a groupoid action equals the average number of fixed points, generalizing the classical case.
Double cosets correspond to orbits of the action on pairs, so their count follows from the lemma.
Linear representations on function spaces yield the same count through invariant theory or character sums.
Both methods work for any groupoid that is finite enough for the averages to be defined.

Where Pith is reading between the lines

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

These formulas might apply to counting morphisms or isomorphisms in categories with groupoid structure.
Further study could link this to Burnside rings or representation rings for groupoids.
The approaches could be tested on concrete examples like action groupoids arising from a group acting on a set.

Load-bearing premise

The groupoid and the sets it acts on must be finite so that the sums defining the averages and the dimensions of the representation spaces are well-defined.

What would settle it

For any particular finite groupoid, list all double cosets by hand and compare the number to the value computed from the extended lemma or the representation dimension.

read the original abstract

We investigate the double cosets of a groupoid, focusing primarily on their enumeration, by means of two different approaches. The first approach extends the Cauchy-Frobenius lemma to groupoids and interprets it in terms of groupoid actions. The second approach is based on linear representations of a groupoid arising from its action on a set of functions.

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

A clean, incremental extension of Burnside's lemma to finite groupoids for double-coset counting, with two standard routes that hold up.

read the letter

The paper extends the Cauchy-Frobenius lemma to groupoids so you can count double cosets by averaging fixed points under the groupoid action, and it gives a second count using the linear representation induced by the action on functions. Both versions reduce to the classical statement when the groupoid is just a group, and the manuscript states the finiteness hypotheses explicitly in the theorems along with the needed definitions of double cosets and fixed-point data. That is the main contribution: a usable technical tool inside category theory and algebraic combinatorics. The derivations follow the usual orbit-counting and representation arguments without visible gaps once the groupoid setting is set up. The stress-test note confirms the hypotheses are in place and the steps are consistent, which matches what the abstract outlines. The work is therefore reproducible in principle for anyone who wants to check the formulas on a concrete finite groupoid. The soft spots are modest and expected. Everything stays inside the finite case, which is required for the averaging to make sense but does rule out infinite groupoids without extra work. The representation approach is essentially a translation of the orbit count into linear algebra; it does not seem to yield new enumerative power beyond the first method, though it may be convenient when one already has representation tools at hand. No load-bearing circularity or missing assumptions appear. This is for category theorists or combinatorialists who already deal with groupoid actions and need a reference formula for double-coset sizes. A reader working on orbit enumeration or Burnside-type problems in categorical settings will get direct value from the explicit statements. It is not foundational, but the claims are grounded enough that a serious referee should see it. I would send it to peer review after a light pass on exposition to make the two approaches easier to compare side by side.

Referee Report

0 major / 1 minor

Summary. The manuscript extends the Cauchy-Frobenius lemma to groupoids in order to enumerate double cosets. It presents two routes: (1) an orbit-counting average formulated in terms of groupoid actions on sets, and (2) a representation-theoretic count obtained from the linear representations induced by the groupoid action on a set of functions. The paper supplies the requisite definitions of double cosets, fixed-point data, and the relevant finiteness hypotheses, and verifies that both constructions reduce to the classical Burnside lemma when the groupoid is a one-object group.

Significance. If the derivations hold, the work supplies a direct, usable generalization of a classical enumeration tool to the groupoid setting. The explicit statement of finiteness hypotheses in the main theorems and the verification of the classical reduction constitute clear strengths. The availability of two independent counting methods (orbit averaging and representation theory) adds robustness and may facilitate applications in enumerative combinatorics and categorical algebra.

minor comments (1)

[Section on linear representations] The notation for the action of a groupoid on the set of functions could be introduced with a short diagram or explicit formula in the section defining the representation-theoretic approach.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, accurate summary of its contributions, and recommendation to accept. The referee's comments correctly identify the two approaches to enumerating double cosets and the verification that both reduce to the classical case.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The manuscript derives an extension of the Cauchy-Frobenius lemma to groupoids for counting double cosets via two routes: an orbit-counting average over groupoid actions and a representation-theoretic count via the induced action on functions. Both derivations start from explicit definitions of groupoid actions, double cosets, fixed-point data, and linear representations, with finiteness hypotheses stated in the theorems. The constructions reduce correctly to the classical group case but do not rely on self-referential definitions, fitted parameters renamed as predictions, or load-bearing self-citations. The central results are obtained by direct algebraic manipulation from the given axioms and are self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based solely on the abstract; no free parameters, axioms, or invented entities are identifiable from the given description.

pith-pipeline@v0.9.0 · 5330 in / 1010 out tokens · 17365 ms · 2026-05-09T16:38:47.251725+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Reference graph

Works this paper leans on

8 extracted references · 1 canonical work pages

[1]

\' A vila; V

J. \' A vila; V. Mar\' i n, The Notions of Center, Commutator and Inner Isomorphism for Groupoids, Ingenier\' i a y Ciencia, 16(31)(2020), 7-26

2020
[2]

Balmer and I

P. Balmer and I. Dell'Ambrogio, Mackey 2-functors and Mackey 2-motives (European Mathmatical'Society (EMS), Z\" u rich, 2020)

2020
[3]

J. J. Barbar\' a n S\' a nchez and L. EI Kaoutit, Linear Representations and Frobenius Morphisms of Groupoids, SIGMA, 15 (2019), 019, 33pp

2019
[4]

Beier, C

G. Beier, C. Garcia,W. G. Lautenschlaeger, J. Pedrotti and T. Tamusiunas. Generalizations of Lagrange and Sylow theorems for groupoids, S a o Paulo J. Math. pages 1-20, 2023

2023
[5]

Brandt, \" U ber eine Verallgemeinerung des Gruppenbegriffes, Math

H. Brandt, \" U ber eine Verallgemeinerung des Gruppenbegriffes, Math. Ann., 96 (1926), 360-366

1926
[6]

Ibort, M

A. Ibort, M. A. Rodr\' i guez. On the structure of finite groupoids and their representations. Symmetry, 11, 414 (2019)

2019
[7]

Ivan, Algebraic constructions of Brandt Groupoids, Proceeding of the Algebra Symposium, Babes-Bolyai University Cluj, 69-90, 2002

G. Ivan, Algebraic constructions of Brandt Groupoids, Proceeding of the Algebra Symposium, Babes-Bolyai University Cluj, 69-90, 2002

2002
[8]

Mar\' i n, H

V. Mar\' i n, H. Pinedo, Groupoids: Direct products, semidirect products and solvability, Algebra and Discrete Math., 33(2), (2022), 92-107. Doi:10.12958/adm 1772

work page doi:10.12958/adm 2022