Search arXivSearch

arXiv · 1702.00217

Operads of decorated cliques

Abstract

The vector space of all polygons with configurations of diagonals is endowed with an operad structure. This is the consequence of a functorial construction $\mathsf{C}$ introduced here, which takes unitary magmas $\mathcal{M}$ as input and produces operads. The obtained operads involve regular polygons with configurations of arcs labeled on $\mathcal{M}$, called $\mathcal{M}$-decorated cliques and generalizing usual polygons with configurations of diagonals. We provide here a complete study of the operads $\mathsf{C}\mathcal{M}$. By considering combinatorial subfamilies of $\mathcal{M}$-decorated cliques defined, for instance, by limiting the maximal number of crossing diagonals or the maximal degree of the vertices, we obtain suboperads and quotients of $\mathsf{C}\mathcal{M}$. This leads to a new hierarchy of operads containing, among others, operads on noncrossing configurations, Motzkin configurations, forests, dissections of polygons, and involutions. We show that the suboperad of noncrossing configurations is Koszul and exhibit its presentation by generators and relations. Besides, the construction $\mathsf{C}$ leads to alternative definitions of several operads, like the operad of bicolored noncrossing configurations and the operads of simple and double multi-tildes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samuele Giraudo. 2017-02-01. Operads of decorated cliques. https://arxiv.org/abs/1702.00217

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO