Related papers: Boolean, Free, and Classical Cumulants as Tree Enu…
We relate a $l$-loop Feynman integral to a sum of phase space integrals, where the integrands are determined by the spanning trees of the original $l$-loop graph. Causality requires that the propagators of the trees have a modified…
We propose new algorithms for generating $k$-statistics, multivariate $k$-statistics, polykays and multivariate polykays. The resulting computational times are very fast compared with procedures existing in the literature. Such speeding up…
We consider the variational complex on infinite jet space and the complex of variational derivatives for Lagrangians of multidimensional paths and study relations between them. The discussion of the variational (bi)complex is set up in…
Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…
We calculate the baryon number cumulants within acceptance with short-range correlations and global baryon number conservation in terms of cumulants in the whole system without baryon conservation. We extract leading and next-to-leading…
A Bialgebra is a module over a ring that is both an associative algebra and a co-associative coalgebra with the product and coproduct additionally satisfying an appropriate commutative relationship. One application of Bialgebras is in the…
We study the coefficients in the expansion of Jack polynomials in terms of power sums. We express them as polynomials in the free cumulants of the transition measure of an anisotropic Young diagram. We conjecture that such polynomials have…
We study the free (associative, non-commutative) Baxter algebra on one generator. The first explicit description of this object is due to Ebrahimi-Fard and Guo. We provide an alternative description in terms of a certain class of trees,…
In this work we study conditional monotone cumulants and additive convolution in the shuffle-algebraic approach to non-commutative probability. We describe c-monotone cumulants as an infinitesimal character and identify the c-monotone…
We establish a link between free probability theory and Witt vectors, via the theory of formal groups. We derive an exponential isomorphism which expresses Voiculescu's free multiplicative convolution $\boxtimes$ as a function of the free…
Since the end of the XIXth century, we know that each birational map of the complex projective plane is the product of a finite number of quadratic birational maps of the projective plane; this motivates our work which essentially deals…
In this paper, we introduce the notion of free-free-Boolean independence relation for triples of algebras. We define free-free-Boolean cumulants ans show that the vanishing of mixed cumulants is equivalent to free-free-Boolean independence.…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
In this paper we define cumulants for finite free convolution. We give a moment-cumulant formula and show that these cumulants satisfy desired properties: they are additive with respect to finite free convolution and they approach free…
In mathematical phylogenetics, the time-consistent galled trees provide a simple class of rooted binary network structures that can be used to represent a variety of different biological phenomena. We study the enumerative combinatorics of…
Commuting pairs of algebraic structures on a set have been studied by several authors and may be described equivalently as algebras for the tensor product of Lawvere theories, or more basically as certain bifunctors that here we call bifold…
By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the…