Related papers: Boolean, Free, and Classical Cumulants as Tree Enu…
In this paper, we study relationships between the normalized characters of symmetric groups and the Boolean cumulants of Young diagrams. Specifically, we show that each normalized character is a polynomial of twisted Boolean cumulants with…
We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…
In the context of random multiplicative energy cascade processes, we derive analytical expressions for translationally invariant one- and two-point cumulants in logarithmic field amplitudes. Such cumulants make it possible to distinguish…
One interesting way to extend the standard model is the hypothesis of bifermions which are bosons which couple to pairs of quarks and leptons. We point out that $SU(15)$ grand unification gives a natural way to classify bifermions and…
We define a product of algebraic probability spaces equipped with two states. This product is called a conditionally monotone product. This product is a new example of independence in non-commutative probability theory and unifies the…
In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in…
We combine infinite-dimensional integration by parts procedures with a recursive relation on moments (reminiscent of a formula by Barbour (1986)), and deduce explicit expressions for cumulants of functionals of a general Gaussian field.…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
We revisit the classical population genetics model of a population evolving under multiplicative selection, mutation and drift. The number of beneficial alleles in a multi-locus system can be considered a trait under exponential selection.…
$C_\infty$ Algebras and their morphisms are a framework in which one can study algebras and their maps that are not commutaive-associative but are homotopic to being that. In statistics cumulants measure the independence of random…
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…
Using the theory of Properly Embedded Graphs developed in an earlier work we define an involutory duality on the set labeled non-crossing trees that lifts the obvious duality in the set of unlabeled non-crossing trees. The set of…
The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
This paper considers the problem of invoking auxiliary, unobservable variables to facilitate the structuring of causal tree models for a given set of continuous variables. Paralleling the treatment of bi-valued variables in [Pearl 1986], we…
We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, to obtain a bijection with a new class of labeled trees, which we call…
We define spreadability systems as a generalization of exchangeability systems in order to unify various notions of independence and cumulants known in noncommutative probability. In particular, our theory covers monotone independence and…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
We show how to enlarge the covariance group of any classical field theory in such a way that the resulting "covariantized" theory is 'essentially equivalent' to the original. In particular, our technique will render any classical field…