13 problems
Rubin's saturation conjecture. Cyclic groups are saturated as long as the prime factors of their order are sufficiently large.
Shortest-path bisaturation conjecture. A shortest path between the trivial -transfer system and the complete -transfer system on a Hasse diagram will pass through as many bis…
Blumberg–Hill's classification conjecture. -operads are completely classified by their associated -transfer systems.
Disklike characterization conjecture. The maximal compatible transfer system is
Non-abelian generalization conjecture. The assumption that is abelian can be removed from the theorems identifying with…
Realization conjecture for compatible pairs. Every compatible pair of transfer systems can be suitably realised as an operad pair.
Abelianness conjecture for saturated groups. If is a saturated finite group, then is abelian.
Two-component LSP compatibility conjecture. Then is not LSP and is compatible with the transfer system generated by adding the edge to .
Let be a finite group. A pair of -transfer systems is called compatible when it satisfies the compatibility conditions for a pairing of -operads, and it is reali…
Let . A transfer system in is maximally extendable if it has the maximal extension property described in the surrounding definitions, and let …
Let with , , and . Fix an arbitrary transfer system on , and let…
Fix positive integers , and let be distinct primes. A saturated transfer system on a finite group is a transfer system satisfying the two-out-of-th…
A -indexing system is a collection of finite -sets for subgroups satisfying the indexing-system axioms; these collections form a poset under inclus…