Related papers: Non-crossing linked partitions and multiplication …
A combinatorial approach to free probability theory has been developped by Roland Speicher, based on the notion of noncrossing cumulants, a free analogue of the classical theory of cumulants in probability theory. We review this theory, and…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…
New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.
In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…
We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
It is becoming increasingly clear that the supercharacter theory of the finite group of unipotent upper-triangular matrices has a rich combinatorial structure built on set-partitions that is analogous to the partition combinatorics of the…
We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…
We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…
A system of linear equations over a skew field has properties similar to properties of a system of linear equations over a field. Even noncommutativity of a product creates a new picture the properties of system of linear equations and of…
Motivated by recent work of Au, C{\'e}bron, Dahlqvist, Gabriel, and Male, we study regularity properties of the distribution of a sum of two selfad-joint random variables in a tracial noncommutative probability space which are free over a…
The wrapping transformation $W$ is a homomorphism from the semigroup of probability measures on the real line, with the convolution operation, to the semigroup of probability measures on the circle, with the multiplicative convolution…
The crossing property is perhaps the most subtle aspect of the particle-field relation. Although it is not difficult to state its content in terms of certain analytic properties relating different matrixelements of the S-matrix or…
We consider finite range Gibbs fields and provide a purely combinatorial proof of the exponential tree decay of semi--invariants, supposing that the logarithm of the partition function can be expressed as a sum of suitable local functions…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
We give a new combinatorial interpretation of the stationary distribution of the (partially) asymmetric exclusion process on a finite number of sites in terms of decorated alternative trees and colored permutations. The corresponding…
A cross matrix $X$ can have nonzero elements located only on the main diagonal and the anti-diagonal, so that the sparsity pattern has the shape of a cross. It is shown that $X$ can be factorized into products of matrices that are at most…
We introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated…
We describe a model of random links based on random 4-valent maps, which can be sampled due to the work of Schaeffer. We will look at the relationship between the combinatorial information in the diagram and the hyperbolic volume.…