Related papers: Random 3-noncrossing partitions
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. The tripartite-circle crossing number of…
The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{n+1}\binom{2n}{n}$ when $\Psi=A_{n-1}$, and the binomial $\binom{2n}{n}$ when $\Psi=B_n$, and these numbers coincide with the correspondent…
We study the probability distribution, $P_N(T)$, of the coincidence time $T$, i.e. the total local time of all pairwise coincidences of $N$ independent Brownian walkers. We consider in details two geometries: Brownian motions all starting…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
There exists a well-known hook-length formula for calculating the dimensions of 2D Young diagrams. Unfortunately, the analogous formula for 3D case is unknown. We introduce an approach for calculating the estimations of dimensions of…
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…
We propose polynomial-time algorithms to minimise labelled Markov chains whose transition probabilities are not known exactly, have been perturbed, or can only be obtained by sampling. Our algorithms are based on a new notion of an…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
Given a set of well-formed terminal pairs on the external face of an undirected planar graph with unit edge weights, we give a linear-time algorithm for computing the union of non-crossing shortest paths joining each terminal pair, where…
An avoidance pattern where the letters within an occurrence of which are required to be adjacent is referred to as a subword. In this paper, we enumerate members of the set NC_n of non-crossing partitions of length n according to the number…
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…
Non-Gaussian likelihoods, ubiquitous throughout cosmology, are a direct consequence of nonlinearities in the physical model. Their treatment requires Monte-Carlo Markov-chain or more advanced sampling methods for the determination of…
This paper extends the framework of randomised matrix multiplication to a coarser partition and proposes an algorithm as a complement to the classical algorithm, especially when the optimal probability distribution of the latter one is…
Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, for…
We present a combinatorial approach to the infinitesimal distribution of the Gaussian orthogonal ensemble (GOE). In particular we show how the infinitesimal moments are described by non-crossing partitions, but not of type B. We demonstrate…
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…
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.
Noncolliding diffusion processes reported in the present paper are $N$-particle systems of diffusion processes in one-dimension, which are conditioned so that all particles start from the origin and never collide with each other in a finite…