Saturated and linear isometric transfer systems for cyclic groups of order \(p^m q^n\) (Q2161365)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Saturated and linear isometric transfer systems for cyclic groups of order \(p^m q^n\)
scientific article

    Statements

    Saturated and linear isometric transfer systems for cyclic groups of order \(p^m q^n\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2022
    0 references
    The transfer systems of the title of the paper are combinatorial objects that classify \(G\)-\(N_{\infty}\)-operads up to homotopy, where a \(G\)-\(N_{\infty}\)-operad is a notion, introduced by \textit{A. J. Blumberg} and \textit{M. A. Hill} [Adv. Math. 285, 658--708 (2015; Zbl 1329.55012)], to govern the structure given by a collection of multiplicative norm maps on a commutative \(G\)-equivariant ring spectrum. The notion of a transfer system is defined in terms of a relation \(L\rightarrow K\) on the subgroup lattice of the group \(G\) such that natural reflexivity, transitivity, conjugation invariance, and restriction properties hold. A transfer system is saturated if this relation \(L\rightarrow K\) satisfies an extra two-out-of-three property. The authors observe that transfer systems associated to linear isometry operads, but not all transfer systems, are saturated. The first main result of the paper is a combinatorial formula, which gives the number of saturated transfer systems associated to the cyclic group \(G = C_{p^m q^n}\) of order \(p^m q^n\), where \(p\) and \(q\) are distinct primes. Then the author proves that for \(G = C_{p q^n}\) with \(p,q>3\), all saturated transfer systems are associated to linear isometry \(G\)-\(N_{\infty}\)-operads.
    0 references
    equivariant stable homotopy
    0 references
    operads
    0 references
    transfer systems
    0 references
    saturation conjecture
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references