Search arXivSearch

arXiv · 1712.03782

Operads in algebraic combinatorics

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 nonsymmetric operads, from finite posets to nonsymmetric operads, from stiff pros to Hopf bialgebras, and from precompositions to nonsymmetric operads. These constructions bring alternative ways to describe already known structures and provide new ones, as for instance, some of the deformations of the noncommutative Faà di Bruno Hopf bialgebra of Foissy and a generalization of the dendriform operad of Loday. We also use algebraic structures to obtain enumerative results. In particular, nonsymmetric colored operads are promising devices to define formal series generalizing the usual ones. These series come with several products (for instance a pre-Lie product, an associative product, and their Kleene stars) enriching the usual ones on classical power series. This provides a framework and a toolbox to strike combinatorial questions in an original way. The first two chapters pose the elementary notions of combinatorics and algebraic combinatorics used here. The last ten chapters contain our original research.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samuele Giraudo. 2017-12-11. Operads in algebraic combinatorics. https://arxiv.org/abs/1712.03782

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO