Search arXivSearch

arXiv · 1603.01394

Pluriassociative algebras II: The polydendriform operad and related operads

Abstract

Dendriform algebras form a category of algebras recently introduced by Loday. A dendriform algebra is a vector space endowed with two nonassociative binary operations satisfying some relations. Any dendriform algebra is an algebra over the dendriform operad, the Koszul dual of the diassociative operad. We introduce here, by adopting the point of view and the tools offered by the theory of operads, a generalization on a nonnegative integer parameter $γ$ of dendriform algebras, called $γ$-polydendriform algebras, so that $1$-polydendriform algebras are dendriform algebras. For that, we consider the operads obtained as the Koszul duals of the $γ$-pluriassociative operads introduced by the author in a previous work. In the same manner as dendriform algebras are suitable devices to split associative operations into two parts, $γ$-polydendriform algebras seem adapted structures to split associative operations into $2γ$ operation so that some partial sums of these operations are associative. We provide a complete study of the $γ$-polydendriform operads, the underlying operads of the category of $γ$-polydendriform algebras. We exhibit several presentations by generators and relations, compute their Hilbert series, and construct free objects in the corresponding categories. We also provide consistent generalizations on a nonnegative integer parameter of the duplicial, triassociative and tridendriform operads, and of some operads of the operadic butterfly.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samuele Giraudo. 2016-03-04. Pluriassociative algebras II: The polydendriform operad and related operads. https://doi.org/10.1016/j.aam.2016.02.004

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