Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1907.01190

Operads of (noncrossing) partitions, interacting bialgebras, and moment-cumulant relations

Kurusch Ebrahimi-Fard·Loïc Foissy·Joachim Kock·Frédéric Patras
View original source ↗Read source document ↗Export metadata ↓

Abstract

We establish and explore a relationship between two approaches to moment-cumulant relations in free probability theory: on one side the main approach, due to Speicher, given in terms of Möbius inversion on the lattice of noncrossing partitions, and on the other side the more recent non-commutative shuffle-algebra approach, where the moment-cumulant relations take the form of certain exponential-logarithm relations. We achieve this by exhibiting two operad structures on (noncrossing) partitions, different in nature: one is an ordinary, non-symmetric operad whose composition law is given by insertion into gaps between elements, the other is a coloured, symmetric operad with composition law expressing refinement of blocks. We show that these operad structures interact so as to make the corresponding incidence bialgebra of the former a comodule bialgebra for the latter. Furthermore, this interaction is compatible with the shuffle structure and thus unveils how the two approaches are intertwined. Moreover, the constructions and results are general enough to extend to ordinary set partitions.

Explore related subjects

math.COmath.PRmath.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kurusch Ebrahimi-Fard, Loïc Foissy, Joachim Kock, Frédéric Patras. 2020-04-16. Operads of (noncrossing) partitions, interacting bialgebras, and moment-cumulant relations. https://doi.org/10.1016/j.aim.2020.107170

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗