The combinatorics of $N_\infty$ operads for $C_{qp^n}$ and $D_{p^n}$ Article Swipe
Related Concepts
Mathematics
Prime (order theory)
Dihedral group
Combinatorics
Dihedral angle
Transfer (computing)
Pure mathematics
Group (periodic table)
Physics
Computer science
Hydrogen bond
Molecule
Parallel computing
Quantum mechanics
Scott Balchin
,
Ethan MacBrough
,
Kyle Ormsby
·
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.1017/s0017089524000211
· OA: W4403101913
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.1017/s0017089524000211
· OA: W4403101913
We provide a general recursive method for constructing transfer systems on finite lattices. Using this, we calculate the number of homotopically distinct $N_{\infty} $ operads for dihedral groups $D_{p^n}$ , $p \gt 2$ prime, and cyclic groups $C_{qp^n}$ , $p \neq q$ prime. We then further display some of the beautiful combinatorics obtained by restricting to certain homotopically meaningful $N_\infty$ operads for these groups.
Related Topics
Finding more related topics…