Protoperads I: Combinatorics and definitions - Université Sorbonne Paris Cité Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

Protoperads I: Combinatorics and definitions

Johan Leray
  • Fonction : Auteur
  • PersonId : 1041646

Résumé

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.
Fichier principal
Vignette du fichier
Leray_Protoperads_I_ combinatorics.pdf (618.97 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01982314 , version 1 (15-01-2019)

Identifiants

Citer

Johan Leray. Protoperads I: Combinatorics and definitions. 2019. ⟨hal-01982314⟩
55 Consultations
39 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More