The combinatorics of operads for and
arXiv:2209.06992
Abstract
We provide a general recursive method for constructing transfer systems on finite lattices. Using this we calculate the number of homotopically distinct operads for dihedral groups , prime, and cyclic groups , prime. We then further display some of the beautiful combinatorics obtained by restricting to certain homotopically meaningful operads for these groups.
v2: pre-proofs version accepted in Glasgow Mathematical Journal, 21 pages, 2 figures. v1: 20 pages, 2 figures; comments welcome!