Operads in algebraic combinatorics
Samuele Giraudo

TL;DR
This thesis develops algebraic structures on combinatorial objects like words, permutations, and trees, enabling new insights and constructions in algebraic combinatorics, including operads, Hopf algebras, and enumerative methods.
Contribution
It introduces new algebraic constructions on combinatorial objects, such as functors from various algebraic structures to operads, and generalizes existing frameworks like the noncommutative Faà di Bruno Hopf algebra.
Findings
Constructed functors from monoids and posets to operads
Generalized the noncommutative Faà di Bruno Hopf algebra
Developed algebraic tools for combinatorial enumeration
Abstract
The main ideas developed in this habilitation thesis consist in endowing combinatorial objects (words, permutations, trees, Young tableaux, etc.) with operations in order to construct algebraic structures. This process allows, by studying algebraically the structures thus obtained (changes of bases, generating sets, presentations, morphisms, representations), to collect combinatorial information about the underlying objects. The algebraic structures the most encountered here are magmas, posets, associative algebras, dendriform algebras, Hopf bialgebras, operads, and pros. This work explores the aforementioned research direction and provides many constructions having the particularity to build algebraic structures on combinatorial objects. We develop for instance a functor from nonsymmetric colored operads to nonsymmetric operads, from monoids to operads, from unitary magmas to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Algebraic structures and combinatorial models · Advanced Combinatorial Mathematics
