Content area

Abstract

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.

Details

Title
The combinatorics of \(N_\infty\) operads for \(C_{qp^n}\) and \(D_{p^n}\)
Author
Balchin, Scott 1 ; MacBrough, Ethan 2 ; Ormsby, Kyle 2 

 Queen’s University Belfast, Belfast, BT7 1NN, UK 
 Reed College, Portland, OR, 97202, USA; University of Washington, Seattle, WA, 98195, USA 
Publication title
Volume
67
Issue
1
Pages
50-66
Publication year
2025
Publication date
Jan 2025
Publisher
Cambridge University Press
Place of publication
Cambridge
Country of publication
United Kingdom
Publication subject
ISSN
00170895
e-ISSN
1469509X
Source type
Scholarly Journal
Language of publication
English
Document type
Journal Article
Publication history
 
 
Online publication date
2024-10-03
Milestone dates
2022-10-12 (Received); 2024-05-23 (Revised); 2024-06-12 (Accepted)
Publication history
 
 
   First posting date
03 Oct 2024
ProQuest document ID
3161646932
Document URL
https://www.proquest.com/scholarly-journals/combinatorics-n-infty-operads-c-qp-d-p/docview/3161646932/se-2?accountid=208611
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Glasgow Mathematical Journal Trust
Last updated
2025-07-22
Database
ProQuest One Academic