有限群的转移系统最小生成集
Minimal generating sets of transfer systems for more non-Abelian Groups
AI总结:
本文研究了有限群的转移系统最小生成集和复杂度,计算了半二面体群和仿射弗罗贝尼乌斯群的宽度,以及二面体群的复杂度,并给出了半二面体群的复杂度下界。
摘要:
对于有限群$G$,$N_\infty$操作符编码了规范映射的集合,并通过Blumberg--Hill和Rubin的工作,其同调范畴等价于$G$-转移系统在$G$的子群格上的偏序集。在\cite{ABB+25}中,作者定义了宽度$w(G)$作为完全$G$-转移系统的最小生成集的大小,并将其与$G$的非平凡meet不可约子群的共轭类数量识别,同时定义了复杂度$c(G)$作为所有转移系统$T$的最大值,即$T$的最小生成集大小的最大值。本文计算了半二面体群$\SD_{2^n}$($n\ge 4$)和仿射弗罗贝尼乌斯群$\AGL(1,p^n)\cong \mathbb{F}_{p^n}\rtimes \mathbb{F}_{p^n}^\times$的宽度,扩展了现有计算并展示了子群格结构如何控制同伦乘法复杂度。此外,本文还计算了阶为$2p^n$的二面体群的复杂度$c(D_{p^n})$,证明了$c(D_{p^n})=\lfloor 3n/2\rfloor+1$,并推导了半二面体群的复杂度下界$c(\SD_{2^n})\ge\lfloor 5(n-1)/2\rfloor$。
英文摘要:
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$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。