相关论文: On $k$-noncrossing partitions

For any integer $k\geq2$, we prove combinatorially the following Euler (binomial) transformation identity $$ \NC_{n+1}^{(k)}(t)=t\sum_{i=0}^n{n\choose i}\NW_{i}^{(k)}(t), $$ where $\NC_{m}^{(k)}(t)$ (resp.~$\NW_{m}^{(k)}(t)$) is the sum of…

In this paper we study $k$-noncrossing matchings. A $k$-noncrossing matching is a labeled graph with vertex set $\{1,...,2n\}$ arranged in increasing order in a horizontal line and vertex-degree 1. The $n$ arcs are drawn in the upper…

The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large…

We give a short proof that a uniform noncrossing partition of the regular $n$-gon weakly converges toward Aldous's Brownian triangulation of the disk, in the sense of the Hausdorff topology. This result was first obtained by Curien &…

We give a criterion for Bruhat order on noncrossing partitions corresponding to the Coxeter element $c=s_1 s_2\cdots s_n$. Using it we prove that the Bruhat order endows noncrossing partitions with a lattice structure. We then explain what…

In this paper we show how to express RNA tertiary interactions via the concepts of tangled diagrams. Tangled diagrams allow to formulate RNA base triples and pseudoknot-interactions and to control the maximum number of mutually crossing…

In this paper we show a a proof by explicit bijections of the famous Kirkman-Cayley formula for the number of dissections of a convex polygon. Our starting point is the bijective correspondence between the set of nested sets made by \(k\)…

Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…

I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic…

We present a categorification of the non-crossing partitions given by crystallographic Coxeter groups. This involves a category of certain bilinear lattices, which are essentially determined by a symmetrisable generalised Cartan matrix…

Chen, Deng, Du, Stanley, and Yan introduced the notion of $k$-crossings and $k$-nestings for set partitions, and proved that the sizes of the largest $k$-crossings and $k$-nestings in the partitions of an $n$-set possess a symmetric joint…

We revisit the twisted multiplicativity property of Voiculescu's S-transform in the operator-valued setting, using a specific bijection between planar binary trees and noncrossing partitions.

We consider $m$-divisible non-crossing partitions of $\{1,2,\ldots,mn\}$ with the property that for some $t\leq n$ no block contains more than one of the first $t$ integers. We give a closed formula for the number of multi-chains of such…

We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.

We situate the noncrossing partitions associated to a finite Coxeter group within the context of the representation theory of quivers. We describe Reading's bijection between noncrossing partitions and clusters in this context, and show…

We give a combinatorial model for the bounded derived category of graded modules over the dual numbers in terms of arcs on the integer line with a point at infinity. Using this model we describe the lattice of thick subcategories of the…

An $k$-noncrossing RNA structure can be identified with an $k$-noncrossing diagram over $[n]$, which in turn corresponds to a vacillating tableaux having at most $(k-1)$ rows. In this paper we derive the limit distribution of irreducible…

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

A \emph{set partition} of the set $[n]=\{1,...c,n\}$ is a collection of disjoint blocks $B_1,B_2,...c, B_d$ whose union is $[n]$. We choose the ordering of the blocks so that they satisfy $\min B_1<\min B_2<...b<\min B_d$. We represent such…