Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMultiplicative and semi-multiplicative functions on non-crossing partitions, and relations to cumulants
53
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider the group (G,*) of unitized multiplicative functions in the incidence algebra of non-crossing partitions, where * denotes the convolution operation. We introduce a larger group (Gtilde,*) of unitized functions from the same incidence algebra, which satisfy a weaker condition of being semi-multiplicative. The natural action of Gtilde 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 Gtilde 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 G can be naturally identified as the group of characters of the Hopf algebra Sym of symmetric functions. We show that Gtilde can also be identified as group of characters of a Hopf algebra T, which is an incidence Hopf algebra in the sense of Schmitt. Moreover, the inclusion of G in Gtilde turns out to be the dual of a natural bialgebra homomorphism from T onto Sym.
rate research
Read More
Boolean, free and monotone cumulants as well as relations among them, have proven to be important in the study of non-commutative probability theory. Quite notably, Boolean cumulants were successfully used to study free infinite divisibility via the Boolean Bercovici--Pata bijection. On the other hand, in recent years the concept of infinitesimal non-commutative probability has been developed, together with the notion of infinitesimal cumulants which can be useful in the context of combinatorial questions. In this paper, we show that the known relations among free, Boolean and monotone cumulants still hold in the infinitesimal framework. Our approach is based on the use of Grassmann algebra. Formulas involving infinitesimal cumulants can be obtained by applying a formal derivation to known formulas. The relations between the various types of cumulants turn out to be captured via the shuffle algebra approach to moment-cumulant relations in non-commutative probability theory. In this formulation, (free, Boolean and monotone) cumulants are represented as elements of the Lie algebra of infinitesimal characters over a particular combinatorial Hopf algebra. The latter consists of the graded connected double tensor algebra defined over a non-commutative probability space and is neither commutative nor cocommutative. In this note it is shown how the shuffle algebra approach naturally extends to the notion of infinitesimal non-commutative probability space. The basic step consists in replacing the base field as target space of linear Hopf algebra maps by the Grassmann algebra over the base field. We also consider the infinitesimal analog of the Boolean Bercovici--Pata map.
We continue our development of a new basis for the algebra of non-commutative symmetric functions. This basis is analogous to the Schur basis for the algebra of symmetric functions, and it shares many of its wonderful properties. For instance, in this article we describe non-commutati
Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=si_1si_2 cdotssi_d$ of a Coxeter element $c$ of $W$, such that $si_i$ is a Coxeter element in a subgroup of type $T_i$ in $W$, $i=1,2,...,d$, and such that the factorisation is minimal in the sense that the sum of the ranks of the $T_i$s, $i=1,2,...,d$, equals the rank of $W$. For the exceptional types, these decomposition numbers have been computed by the first author. The type $A_n$ decomposition numbers have been computed by Goulden and Jackson, albeit using a somewhat different language. We explain how to extract the type $B_n$ decomposition numbers from results of Bona, Bousquet, Labelle and Leroux on map enumeration. Our formula for the type $D_n$ decomposition numbers is new. These results are then used to determine, for a fixed positive integer $l$ and fixed integers $r_1le r_2le ...le r_l$, the number of multi-chains $pi_1le pi_2le ...le pi_l$ in Armstrongs generalised non-crossing partitions poset, where the poset rank of $pi_i$ equals $r_i$, and where the block structure of $pi_1$ is prescribed. We demonstrate that this result implies all known enumerative results on ordinary and generalised non-crossing partitions via appropriate summations. Surprisingly, this result on multi-chain enumeration is new even for the original non-crossing partitions of Kreweras. Moreover, the result allows one to solve the problem of rank-selected chain enumeration in the type $D_n$ generalised non-crossing partitions poset, which, in turn, leads to a proof of Armstrongs $F=M$ Conjecture in type $D_n$.
We consider $m$-divisible non-crossing partitions of ${1,2,ldots,mn}$ with the property that for some $tleq n$ no block contains more than one of the first $t$ integers. We give a closed formula for the number of multi-chains of such non-crossing partitions with prescribed number of blocks. Building on this result, we compute Chapotons $M$-triangle in this setting and conjecture a combinatorial interpretation for the $H$-triangle. This conjecture is proved for $m=1$.
It is shown that in a class of counterexamples to Elliotts conjecture by Matomaki, Radziwill and Tao, the Chowla conjecture holds along a subsequence.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
