Computational Biology, Probability and Combinatorics

Program for Random 3-noncrossing Partitions

Download:

MAPLE program: ranpar.mws(WinRAR file)

General Imformation:

Attached package is implemented by Maple 12. Let N denote the number of vertices, then you can use RandomP(N) and RandomR(N) to generate a lattice corresponding to a 3-noncrossing partition and a 3-noncrossing braid without loops (equivalent to 2-regular, 3-noncrossing partition via our bijection).