Search arXivSearch

arXiv · 2402.01500

Operads of decorated cliques II: Noncrossing cliques

Abstract

A complete study of an operad $\mathrm{NC} \mathcal{M}$ of noncrossing configurations of chords introduced in previous work of the author is performed. This operad is defined on the linear span of all noncrossing $\mathcal{M}$-cliques. These are noncrossing configurations of chords with arcs labeled by a unitary magma $\mathcal{M}$. The magmatic product of $\mathcal{M}$ intervenes for the computation of the operadic composition of $\mathcal{M}$-cliques. We show that this operad is binary, quadratic, and Koszul by considering techniques coming from rewrite systems on trees. We also compute a presentation for its Koszul dual. Finally, we explain how $\mathrm{NC} \mathcal{M}$ allows one to obtain alternative constructions of already known operads like operads of formal fractions and the operad of bicolored noncrossing configurations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samuele Giraudo. 2024-02-02. Operads of decorated cliques II: Noncrossing cliques. https://arxiv.org/abs/2402.01500

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