The combinatorics of \(N_\infty\) operads for \(C_{qp^n}\) and \(D_{p^n}\) (Q7033960)

Let \((P,\leq_P)\) be a poset considered as a category. A categorical transfer system \(R\) is a subcategory that contains all objects of \(P\), and it is closed under pullbacks~[\textit{E. E. Franchere} et al., Homology Homotopy Appl. 24, No. 2, 115--134 (2022; Zbl 1506.55011)]. The work of \textit{S. Balchin} et al. [Pac. J. Math. 315, No. 2, 285--304 (2021; Zbl 1518.18016)] describes transfer systems on the linear order \([n]=\{0<1<2<\cdots<n\}\). The paper under review generalizes the techniques of the aforementioned paper to families of transfer systems on the poset \([1]\times [n]\).\N\NA transfer system is saturated if it satisfies the 2 out of 3 property, and liftable if, \((1,i)R(1,j)\) and \( i<j\), then \((0,i)R(1,i)\). Proposition 3.3 counts the number of saturated and liftable transfer systems, while Theorem 3.12 provides a recursive algorithm for computing liftable transfer systems. Theorem 4.3 provides a recursive algorithm for counting all transfer systems on \([1]\times[n]\).\N\NThe authors raise the question of finding exact expressions or generating series for the sequences they compute. They analyze those transfer systems satisfying \((0,n)R(1,n)\) using Tamari intervals, and maximally extendable transfer systems using Schröder numbers.\N\NThe purely combinatorial concept of transfer systems encodes structure in equivariant homotopy theory. The authors relate each family of transfer systems discussed to the theory of \(G-N_\infty\) operads when \(G=D_{p^n}\) (in Proposition 3.2, Remark 3.4, and Corollary 3.13 ), or \(C_{qp^n}\) (Corollary 4.4); see also Remark 6.2.\N\NAn \(E_\infty\) operad describes commutativity up to coherent homotopy. Given a finite group \(G\), the \(G\)-equivariant analogue is given by \(N_\infty\) operads, introduced by \textit{A. J. Blumberg} and \textit{M. A. Hill} [Adv. Math. 285, 658--708 (2015; Zbl 1329.55012)]. The collection of transfer systems on a finite poset \(P\) is denoted by \(Tr(P)\); in particular, for a finite group \(G\), \(Tr(G)\) refers to the collection of transfer systems on the poset of subgroups of \(G\), closed under conjugation. Results from [Blumberg and Hill, loc. cit.], [\textit{P. Bonventre} and \textit{L. A. Pereira}, Adv. Math. 381, Article ID 107502, 134 p. (2021; Zbl 1464.18017)], [\textit{J. J. Gutiérrez} and \textit{D. White}, Algebr. Geom. Topol. 18, No. 5, 2919--2962 (2018; Zbl 1406.55002)], [\textit{J. Rubin}, Algebr. Geom. Topol. 21, No. 7, 3513--3568 (2021; Zbl 1482.55011)], [\textit{J. Rubin}, Glasg. Math. J. 63, No. 2, 307--342 (2021; Zbl 1464.55018)] show that the category induced by \(Tr(G)\) is equivalent to the homotopy category of \(G-N_{\infty}\) operads. For an overview of \(G-N_\infty\) operads see the related talks at the workshop ``Operad and Calculus'' at the Isaac Newton Institute for Mathematical Sciences, April 2025.