English
Related papers

Related papers: Non-crossing linked partitions and multiplication …

200 papers

A combinatorial formula is derived which expresses free cumulants in terms of classical comulants. As a corollary, we give a combinatorial interpretation of free cumulants of classical distributions, notably Gaussian and Poisson…

Combinatorics · Mathematics 2007-05-23 Franz Lehner

In this paper, we present a combinatorial approach to the opposite 2-variable bi-free partial $S$-transforms where the opposite multiplication is used on the right. In addition, extensions of this partial $S$-transforms to the conditional…

Operator Algebras · Mathematics 2019-02-08 Paul Skoufranis

In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…

Combinatorics · Mathematics 2023-10-24 Juan B. Gil , Jordan O. Tirrell

Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…

Combinatorics · Mathematics 2008-10-09 Guoce Xin , Terence Y. J. Zhang

To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…

Combinatorics · Mathematics 2013-03-12 Ravindra Bapat , Ebrahim Ghorbani

We establish connections between the lattices of non-crossing partitions of type B introduced by V. Reiner, and the framework of the free probability theory of D. Voiculescu. Lattices of non-crossing partitions (of type A, up to now) have…

Operator Algebras · Mathematics 2007-05-23 Philippe Biane , Frederick Goodman , Alexandru Nica

We study some combinatorial statistics defined on the set $NC^{(mton)}(n)$ of monotonically ordered non-crossing partitions of {1,...,n}, and on the set $NC_2^{(mton)}(2n)$ of monotonically ordered non-crossing pair-partitions of…

Combinatorics · Mathematics 2025-10-28 Natasha Blitvic , Thomas Bray , Jacob Campbell , Alexandru Nica

In this paper we prove a duality between $k$-noncrossing partitions over $[n]=\{1,...,n\}$ and $k$-noncrossing braids over $[n-1]$. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to…

Combinatorics · Mathematics 2007-11-15 Emma Y. Jin , Jing Qin , Christian M. Reidys

We consider noncrossing partitions of [n] under the action of (i) the reflection group (of order 2), (ii) the rotation group (cyclic of order n) and (iii) the rotation/reflection group (dihedral of order 2n). First, we exhibit a bijection…

Combinatorics · Mathematics 2007-05-23 David Callan , Len Smiley

The present thesis studies structural properties of non-crossing partitions associated to finite Coxeter groups from both algebraic and geometric perspectives. On the one hand, non-crossing partitions are lattices, and on the other hand, we…

Combinatorics · Mathematics 2019-03-18 Julia Heller

We compute the representation theory of two families of noncrossing partition quantum groups connected to amalgamated free products and free wreath products. This illustrates the efficiency of the methods developed in our previous joint…

Representation Theory · Mathematics 2018-06-12 Amaury Freslon

Higher-order notions of Kreweras complementation have appeared in the literature in the works of Krawczyk, Speicher, Mastnak, Nica, Arizmendi, Vargas, and others. While the theory has been developed primarily for specific applications in…

Combinatorics · Mathematics 2025-08-26 Kurusch Ebrahimi-Fard , Loïc Foissy , Joachim Kock , Frédéric Patras

This work investigates the combinatorial structures underlying cyclic conditional freeness and introduces cumulants that serve to linearize the cyclic conditional additive convolution. In the process, we establish the notion of "cyclic…

Operator Algebras · Mathematics 2026-02-23 Octavio Arizmendi , Guillaume Cébron , Nicolas Gilliers

To a planar algebra P in the sense of Jones we associate a natural non- commutative ring, which can be viewed as the ring of non-commutative polynomials in several indeterminates, invariant under a symmetry encoded by P. We show that this…

Operator Algebras · Mathematics 2010-09-07 D. Shlyakhtenko

We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site…

Combinatorics · Mathematics 2024-10-08 Fabian Burghart

We study the linear span of commutators of free random variables and show that these are the only quadratic forms which satisfy the following equivalent properties: * preservation free infinite divisibility * free and strong cancellation of…

Operator Algebras · Mathematics 2024-05-31 Wiktor Ejsmont , Franz Lehner

In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…

Combinatorics · Mathematics 2009-11-17 Jing Qin , Christian M. Reidys

In the present paper we extend the definition of slice-torus invariant to links. We prove a few properties of the newly-defined slice-torus link invariants: the behaviour under crossing change, a slice genus bound, an obstruction to strong…

Geometric Topology · Mathematics 2020-11-18 Alberto Cavallo , Carlo Collari

The present material addresses several problems left open in the Trans. AMS paper " Non-crossing cumulants of type B" of P. Biane, F. Goodman and A. Nica. The main result is that a type B non-commutative probability space can be studied in…

Operator Algebras · Mathematics 2007-10-15 Mihai Popa

We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those…

Computer Science and Game Theory · Computer Science 2014-10-10 Adam Clearwater , Clemens Puppe , Arkadii Slinko