arXiv:1901.05653 [math.AT]AbstractReferencesReviewsResources
Protoperads i: Combinatorics and definitions
Published 2019-01-17Version 1
This paper is the first of two articles which develop the notion of protoperads. In this one, we construct a new monoidal product on the category of reduced S-modules. We study the associated monoids, called protoperads, which are a generalization of operads. As operads encode algebraic operations with several inputs and one outputs, protoperads encode algebraic operations with the same number of inputs and outputs. We describe the underlying combinatorics of protoperads, and show that there exists a notion of free protoperad. We also show that the monoidal product introduced here is related to Vallette's one on the category of S-bimodules, via the induction functor.
Categories: math.AT
Related articles: Most relevant | Search more
arXiv:2411.16716 [math.AT] (Published 2024-11-22)
Equivalence of different definitions of higher $ρ$ invariants
arXiv:1801.09311 [math.AT] (Published 2018-01-28)
On the combinatorics of faces of trees and anodyne extensions of dendroidal sets
arXiv:math/0005199 [math.AT] (Published 2000-05-20)
Moment-angle complexes and combinatorics of simplicial manifolds