Related papers: Boolean, Free, and Classical Cumulants as Tree Enu…
The paper considers multivariate discrete random sums with equal number of summands. Such distributions describe the total claim amount received by a company in a fixed time point. In Queuing theory they characterize cumulative waiting…
One classical theory, as determined by an equation of motion or set of classical trajectories, can correspond to many unitarily {\em in}equivalent quantum theories upon canonical quantization. This arises from a remarkable ambiguity, not…
We study the problem of conditional expectations in free random variables and provide closed formulas for the conditional expectation of resolvents of arbitrary non-commutative polynomials in free random variables onto the subalgebra of an…
We present a graph theoretical approach to the configurational statistics of random tree-like objects, such as randomly branching polymers. In particular, for ideal trees we show that Pr\"ufer labelling provides: (i) direct access to the…
A formula expressing cumulants in terms of iterated integrals of the distribution function is derived. It generalizes results of Jones and Balakrishnan who computed expressions for cumulants up to order 4.
Let $G$ be a finite group. We consider the problem of counting simultaneous conjugacy classes of $n$-tuples and simultaneous conjugacy classes of commuting $n$-tuples in $G$. Let $\alpha_{G,n}$ denote the number of simultaneous conjugacy…
Generalizing a sequence of Lambert, Cayley and Ramanujan, Chapoton has recently introduced a polynomial sequence Q_n:=Q_n(x,y,z,t) defined by Q_1=1, Q_{n+1}=[x+nz+(y+t)(n+y\partial_y)]Q_n. In this paper we prove Chapoton's conjecture on the…
A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…
We refine the complexity landscape for enumeration problems by introducing very low classes defined by using Boolean circuits as enumerators. We locate well-known enumeration problems, e.g., from graph theory, Gray code enumeration, and…
Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
Peca suggested in a recent paper on the arxiv to consider binary butterfly trees and their Horton-Strahler numbers. The trees are obtained by glueing two binary trees together in a special way; the results are again binary trees but with a…
There is a classical geometric construction which uses a binary quadratic form to define an involution on the space of binary d-ics. We give a complete characterization of a general class of such involutions which are definable using…
Given two polynomials $p(x), q(x)$ of degree $d$, we give a combinatorial formula for the finite free cumulants of $p(x)\boxtimes_d q(x)$. We show that this formula admits a topological expansion in terms of non-crossing multi-annular…
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…
According to Jae Suk Park, physicists use "canonical coordinate systems" to compute correlations in perturbative quantum field theories. One may interpret these canonical coordinate systems as equivalences of generalized differential Lie…
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We study subordination of free convolutions. We prove that for free random variables $X,Y$ and a Borel function $f$ the conditional expectation $E_\varphi\left[ (z-X-f(X)Yf^*(X))^{-1}| X\right]$, is a resolvent again. This result allows…
In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive…