Random $k$-noncrossing partitions

Details Random $k$-noncrossing partitions Random $k$-noncrossing partitions

2009-11-16

arxiv.org/abs/0911.2960v1

Mathematics

Combinatorics

20 pages

Scientific paper

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 crossing arcs in its canonical representation and is 2-regular if the latter does not contain arcs of the form $(i,i+1)$. Using a bijection of Chen {\it et al.} \cite{Chen,Reidys:08tan}, we interpret $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions as restricted generalized vacillating tableaux. Furthermore, we interpret the tableaux as sampling paths of a Markov-processes over shapes and derive their transition probabilities.

Affiliated with

Also associated with

No associations

Rating

Random $k$-noncrossing partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random $k$-noncrossing partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random $k$-noncrossing partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-498851