arxiv: 2605.04780 · v1 · submitted 2026-05-06 · 🧮 math.CO · math.AT

Recognition: unknown

Minimal generating sets of transfer systems for more non-Abelian Groups

Bheemarasetty Chakravarthy, Surojit Ghosh

Pith reviewed 2026-05-08 16:17 UTC · model grok-4.3

classification 🧮 math.CO math.AT

keywords transfer systemssemidihedral groupsdihedral groupsaffine Frobenius groupssubgroup latticesN_infty operadswidthcomplexity

0 comments

The pith

The width of complete transfer systems for semidihedral and affine Frobenius groups equals the number of conjugacy classes of proper meet-irreducible subgroups.

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

The paper determines the width w(G), the smallest generating set size for the full collection of G-transfer systems on the subgroup lattice, for semidihedral groups of order 2^n with n at least 4 and for affine groups AGL(1, p^n). It also determines the exact complexity c(G), the largest minimal generating set size over all transfer systems, for dihedral groups of order 2p^n as floor of 3n over 2 plus 1, and gives a matching lower bound for the semidihedral case. These quantities arise because N_infty operads correspond to transfer systems, so the numbers control how many independent norm maps are needed to generate all multiplicative structures in equivariant homotopy for those groups. The calculations rest on the subgroup lattices' meet-irreducible elements and their conjugacy classes, extending prior identifications to new families of non-Abelian groups.

Core claim

The authors compute w(SD_{2^n}) and w(AGL(1,p^n)) directly from the conjugacy classes of proper meet-irreducible subgroups, establish that c(D_{p^n}) equals floor(3n/2) plus 1 for odd prime p, and obtain the lower bound c(SD_{2^n}) at least floor(5(n-1)/2).

What carries the argument

The width w(G), the size of the smallest generating set for the complete G-transfer system on the subgroup lattice, which the paper identifies with the number of conjugacy classes of proper meet-irreducible subgroups.

If this is right

The complete transfer system on these groups is generated by one element per conjugacy class of proper meet-irreducible subgroups.
Complexity grows linearly with the exponent n in the dihedral case of order 2p^n.
Semidihedral groups have complexity at least roughly 2.5 times the exponent minus a constant.
Subgroup lattice geometry fixes the equivariant multiplicative complexity for these families.

Where Pith is reading between the lines

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

The same lattice-based counting may produce closed formulas for w(G) and c(G) across wider classes of p-groups once their meet-irreducible structures are classified.
In equivariant stable homotopy, these numbers bound the number of independent multiplications possible in spectra with the given group action.
Transfer-system complexity could serve as a new numerical invariant distinguishing families of groups that share the same order.

Load-bearing premise

The subgroup lattices of the semidihedral, affine, and dihedral groups possess exactly the meet-irreducible elements and conjugacy relations required by the width and complexity formulas.

What would settle it

Explicit enumeration of minimal generating sets for the complete transfer system on SD_{2^5} or D_{p^3} that yields a width or complexity value different from the stated formula.

Figures

Figures reproduced from arXiv: 2605.04780 by Bheemarasetty Chakravarthy, Surojit Ghosh.

**Figure 1.** Figure 1: illustrates the three arrow types for n = 2. c0 c1 c2 d0 d1 d2 view at source ↗

**Figure 2.** Figure 2: Panels (i)–(iii): in each type, the longer left-anchored solid arrow generates the shorter dashed one by restriction, proving Lemma 4.5(i). Panel (iv): the solid D-arrow (d0, d2) forces both C-arrows (c0, c1) and (c0, c2) (red dashed) into ⟨S⟩ via (1), proving Lemma 4.5(ii). This cross-type phenomenon has no analogue in the Cpnq setting. Proposition 4.7 (Bridge-exclusion bounds). Let S be a minimal generat… view at source ↗

**Figure 3.** Figure 3: illustrates the bridge-exclusion argument from Sub-case 2b of the proof of Proposition 4.7(1). c0 ca ck cl d0 da dk db (d0, dk) ∈ U0 (c0, cl) ∈ U0 (da, db) ∈ U′ U ′ A U ′ P-value: 0 a k l B b ⇒ (c0, cl) ∈ ⟨S⟩ [ contradiction ⊥ ] view at source ↗

read the original abstract

For a finite group $G$, $N_\infty$ operads encode collections of norm maps, and by work of Blumberg--Hill and Rubin their homotopy category is equivalent to the poset of $G$--transfer systems on the subgroup lattice of $G$. In \cite{ABB+25} the authors defined the \emph{width} $w(G)$ as the minimal size of a generating set for the complete $G$--transfer system and identified it with the number of conjugacy classes of proper meet irreducible subgroups of $G$, and the \emph{complexity} $c(G)$ as the maximum, over all transfer systems $T$, of the size of a minimal generating set for $T$. We compute $w(G)$ for the semidihedral groups $\SD_{2^n}$ ($n\ge 4$) and the affine Frobenius groups $\AGL(1,p^n)\cong \mathbb{F}_{p^n}\rtimes \mathbb{F}_{p^n}^\times$, extending existing calculations and highlighting how subgroup lattice structure governs equivariant multiplicative complexity. We also compute $c(D_{p^n})$ for dihedral groups of order $2p^n$ with $p$ an odd prime, establishing $c(D_{p^n})=\lfloor 3n/2\rfloor+1$, and derive the lower bound $c(\SD_{2^n})\ge\lfloor 5(n-1)/2\rfloor$.

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 explicit formulas for w on semidihedral and affine Frobenius groups plus an exact c value and lower bound for certain dihedral groups, extending the ABB+25 lattice approach.

read the letter

The core contribution is the explicit computation of w(SD_{2^n}) and w(AGL(1,p^n)) for n large enough, together with c(D_{p^n}) = floor(3n/2)+1 and the lower bound floor(5(n-1)/2) for c on the semidihedrals. These are new concrete numbers for families that appear in equivariant homotopy work on N_infty operads. The authors apply the prior identification of w(G) with conjugacy classes of proper meet-irreducible subgroups and then count those classes directly from the known subgroup lattices. That step is the actual new work, and it produces clean closed forms rather than just tables. The lattice analysis for these particular groups is the part that looks solid on the surface; the formulas follow once the meet-irreducibles and their conjugacy orbits are listed correctly. The lower bound on c for semidihedrals is a direct consequence of the same counting and is stated clearly. The main soft spot is verification of the lattice counts themselves. The arguments depend on not missing or misclassifying any meet-irreducible subgroups (for instance the index-2 cyclics or the dihedral subgroups of order 2p^k in the D_{p^n} case). Without subgroup diagrams or an exhaustive list in the text, a reader has to trust that every proper meet-irreducible was caught and placed in the right orbit. That is a standard risk in this style of paper, but it is the load-bearing step. The work is aimed at specialists who already use transfer systems and need numbers for these groups rather than a general audience. It is a straightforward extension of the earlier framework, so it deserves a serious referee who can check the lattice details and confirm the conjugacy claims. I would send it to review.

Referee Report

2 major / 2 minor

Summary. The manuscript computes the width w(G), identified with the number of conjugacy classes of proper meet-irreducible subgroups, for the semidihedral groups SD_{2^n} (n≥4) and the affine Frobenius groups AGL(1,p^n)≅F_{p^n}⋊F_{p^n}^×. It also computes the complexity c(G), the maximum size of a minimal generating set over all G-transfer systems T, for the dihedral groups D_{p^n} of order 2p^n (p odd prime), establishing the explicit value c(D_{p^n})=⌊3n/2⌋+1, and derives the lower bound c(SD_{2^n})≥⌊5(n-1)/2⌋ from lattice analysis.

Significance. If the subgroup-lattice identifications hold, these explicit computations and bounds extend the framework of ABB+25 by providing concrete data on how meet-irreducible conjugacy classes control the minimal generating sets of transfer systems. The results supply falsifiable numerical predictions for N_∞ operads and highlight the role of poset structure in equivariant multiplicative complexity.

major comments (2)

[Dihedral groups section] Dihedral groups section: the equality c(D_{p^n})=⌊3n/2⌋+1 is obtained by applying the width formula to the conjugacy classes of meet-irreducible subgroups (cyclic of index 2 and dihedral of order 2p^k). Without an explicit list or poset diagram enumerating these classes for general n, the floor-function derivation cannot be checked and is load-bearing for the central claim.
[Semidihedral groups section] Semidihedral groups section: the lower bound c(SD_{2^n})≥⌊5(n-1)/2⌋ rests on the identification of w(G) with conjugacy classes of proper meet-irreducible subgroups and the construction of a specific transfer system achieving that size. The manuscript supplies no independent lattice diagram or verification that the conjugacy action preserves the required poset structure, which is the load-bearing step carried over from ABB+25.

minor comments (2)

[Abstract] The abstract and introduction could include a one-sentence recall of the definitions of w(G) and c(G) from ABB+25 to improve readability for readers outside the immediate subfield.
[Introduction] Notation for the subgroup lattice and meet-irreducible elements is used without a small summary table; adding one would clarify the counting arguments.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and for identifying points where additional explicit details would strengthen verifiability. We will revise the manuscript to include enumerations of conjugacy classes, poset diagrams, and brief verifications of the lattice structure, making the derivations for c(D_{p^n}) and the lower bound for c(SD_{2^n}) directly checkable while preserving the original results.

read point-by-point responses

Referee: [Dihedral groups section] Dihedral groups section: the equality c(D_{p^n})=⌊3n/2⌋+1 is obtained by applying the width formula to the conjugacy classes of meet-irreducible subgroups (cyclic of index 2 and dihedral of order 2p^k). Without an explicit list or poset diagram enumerating these classes for general n, the floor-function derivation cannot be checked and is load-bearing for the central claim.

Authors: We agree that an explicit enumeration aids verification. In D_{p^n} the proper meet-irreducible subgroups consist of the unique cyclic subgroup of index 2 together with the dihedral subgroups of order 2p^k (k=1,...,n). These form ⌊3n/2⌋+1 conjugacy classes under the inversion action, so the width formula from ABB+25 directly yields c(D_{p^n})=⌊3n/2⌋+1. We will add a table listing the classes for general n and a diagram of the relevant portion of the subgroup lattice in the revised version. revision: yes
Referee: [Semidihedral groups section] Semidihedral groups section: the lower bound c(SD_{2^n})≥⌊5(n-1)/2⌋ rests on the identification of w(G) with conjugacy classes of proper meet-irreducible subgroups and the construction of a specific transfer system achieving that size. The manuscript supplies no independent lattice diagram or verification that the conjugacy action preserves the required poset structure, which is the load-bearing step carried over from ABB+25.

Authors: The identification w(G) equals the number of conjugacy classes of proper meet-irreducible subgroups is taken from ABB+25, but we can make the application to SD_{2^n} self-contained. The subgroup lattice of SD_{2^n} comprises cyclic, dihedral and semidihedral subgroups whose meet-irreducible elements are closed under conjugation by the defining relations; the conjugacy classes therefore inherit the poset structure needed for the transfer-system construction. We will include a lattice diagram (for small n together with the general pattern) and a short paragraph confirming that conjugation preserves meet-irreducibility, thereby verifying the lower bound ⌊5(n-1)/2⌋. revision: yes

Circularity Check

0 steps flagged

No significant circularity: w(G) and c(G) values are obtained by direct enumeration on subgroup lattices.

full rationale

The paper cites ABB+25 solely to recall the definition of w(G) as the number of conjugacy classes of proper meet-irreducible subgroups and defines c(G) as the maximum size of a minimal generating set over transfer systems. It then applies these definitions to the known subgroup lattices of SD_{2^n}, AGL(1,p^n), and D_{p^n} by identifying meet-irreducible elements and conjugacy classes, yielding explicit formulas such as c(D_{p^n})=⌊3n/2⌋+1. No step equates a computed value to a fitted parameter by construction, no self-referential definition appears, and the cited identification is external foundational work rather than a load-bearing chain that reduces the new results to prior outputs. The derivation consists of independent lattice analysis.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on the definition of transfer systems and the width identification from Blumberg-Hill, Rubin, and ABB+25; no new free parameters or invented entities are introduced.

axioms (2)

domain assumption The width w(G) equals the number of conjugacy classes of proper meet-irreducible subgroups of G.
Invoked from the cited work ABB+25 to reduce the problem to lattice combinatorics.
domain assumption Subgroup lattices of SD_{2^n}, AGL(1,p^n), and D_{p^n} admit explicit descriptions of their meet-irreducible elements and conjugacy classes.
Standard fact in finite group theory used to perform the counting.

pith-pipeline@v0.9.0 · 5565 in / 1428 out tokens · 56121 ms · 2026-05-08T16:17:55.616489+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

10 extracted references · 2 canonical work pages

[1]

Adamyk, S

K. Adamyk, S. Balchin, M. Barrero, S. Scheirer, N. Wisdom, and V. Zapata Castro,On minimal bases in homotopical combinatorics, preprint (2025), arXiv:2506.11159

work page arXiv 2025
[2]

Balchin,ninfty: A software package for homotopical combinatorics, arXiv:2504.01003, 2025

S. Balchin,ninfty: A software package for homotopical combinatorics, arXiv:2504.01003, 2025

work page arXiv 2025
[3]

Balchin, D

S. Balchin, D. Barnes, and C. Roitzheim,N ∞-operads and associahedra, Pacific J. Math.315 (2021), no. 2, 285–304

2021
[4]

L. Bao, C. Hazel, T. Karkos, A. Kessler, A. Nicolas, K. Ormsby, J. Park, C. Schleff, and S. Tilton,Transfer systems for rank two elementary abelian groups: characteristic functions and matchstick games, Tunis. J. Math.7(2025), no. 1, 167–191

2025
[5]

A. J. Blumberg and M. A. Hill,Operadic multiplications in equivariant spectra, norms, and transfers, Adv. Math.285(2015), 658–708

2015
[6]

Balchin, E

S. Balchin, E. MacBrough, and K. Ormsby,The combinatorics ofN ∞ operads forC qpn and Dpn, Glasg. Math. J.67(2025), no. 1, 50–66

2025
[7]

Bonventre and L

P. Bonventre and L. A. Pereira,Genuine equivariant operads, Adv. Math.381(2021), Paper No. 107502

2021
[8]

Klanderman, C

S. Klanderman, C. Lewis, H. Monson, K. Shibata, and D. Van Niel,Characterizing transfer systems for non-abelian groups, preprint (2025)

2025
[9]

Rubin,CombinatorialN ∞ operads, Algebr

J. Rubin,CombinatorialN ∞ operads, Algebr. Geom. Topol.21(2021), no. 7, 3513–3568

2021
[10]

Rubin,Detecting Steiner and linear isometries operads, Glasg

J. Rubin,Detecting Steiner and linear isometries operads, Glasg. Math. J.63(2021), no. 2, 307–342. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee 247667, India Email address:b chakravarthy@ma.iitr.ac.in Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee 247667, India Email address:surojit.ghosh@ma.iitr.ac.in

2021