加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本