Search arXivSearch

arXiv · 2106.16072

Multiplicative and semi-multiplicative functions on non-crossing partitions, and relations to cumulants

Abstract

We consider the group $(\mathcal{G},*)$ of unitized multiplicative functions in the incidence algebra of non-crossing partitions, where ``$*$'' denotes the convolution operation. We introduce a larger group $(\widetilde{\mathcal{G}},*)$ of unitized functions from the same incidence algebra, which satisfy a weaker condition of being ``semi-multiplicative''. The natural action of $\widetilde{\mathcal{G}}$ on sequences of multilinear functionals of a non-commutative probability space captures the combinatorics of transitions between moments and some brands of cumulants that are studied in the non-commutative probability literature. We use the framework of $\widetilde{\mathcal{G}}$ in order to explain why the multiplication of free random variables can be very nicely described in terms of Boolean cumulants and more generally in terms of $t$-Boolean cumulants, a one-parameter interpolation between free and Boolean cumulants arising from work of Bozejko and Wysoczanski. It is known that the group $\mathcal{G}$ can be naturally identified as the group of characters of the Hopf algebra Sym of symmetric functions. We show that $\widetilde{\mathcal{G}}$ can also be identified as group of characters of a Hopf algebra $\mathcal{T}$, which is an incidence Hopf algebra in the sense of Schmitt. Moreover, the inclusion of $\mathcal{G}$ into $\widetilde{\mathcal{G}}$ turns out to be the dual of a natural bialgebra homomorphism from $\mathcal{T}$ onto Sym.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adrian Celestino, Kurusch Ebrahimi-Fard, Alexandru Nica, Daniel Perales, Leon Witzman. 2022-12-12. Multiplicative and semi-multiplicative functions on non-crossing partitions, and relations to cumulants. https://doi.org/10.1016/j.aam.2022.102481

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