Minimal generating sets of transfer systems for more non-Abelian Groups
Abstract
For a finite group , operads encode collections of norm maps, and by work of Blumberg--Hill and Rubin their homotopy category is equivalent to the poset of --transfer systems on the subgroup lattice of . In \cite{ABB+25} the authors defined the \emph{width} as the minimal size of a generating set for the complete --transfer system and identified it with the number of conjugacy classes of proper meet irreducible subgroups of , and the \emph{complexity} as the maximum, over all transfer systems , of the size of a minimal generating set for . We compute for the semidihedral groups () and the affine Frobenius groups , extending existing calculations and highlighting how subgroup lattice structure governs equivariant multiplicative complexity. We also compute for dihedral groups of order with an odd prime, establishing , and derive the lower bound .
Keywords
Cite
@article{arxiv.2605.04780,
title = {Minimal generating sets of transfer systems for more non-Abelian Groups},
author = {Bheemarasetty Chakravarthy and Surojit Ghosh},
journal= {arXiv preprint arXiv:2605.04780},
year = {2026}
}
Comments
This is a part of Bheemarasetty Chakravarthy's BS-MS thesis. Comments are welcome!