On minimal bases in homotopical combinatorics
Abstract
We present a development in the computational suite for the study of N∞ operads for a finite group G. This progress is achieved using the simple yet powerful observation that Rubin's generation algorithm can be interpreted as a closure operator. Leveraging this perspective, we establish the existence of minimal bases for N∞ operads. By investigating these bases for certain families of groups we are led to introduce and analyze several novel combinatorial invariants for finite groups.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.