Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

DM
2008

favoriteEmaildiscussreport

70views more DM 2008»

Enumeration of (k, 2)-noncrossing partitions

13 years 4 months ago

Enumeration of (k, 2)-noncrossing partitions

Download www.iqc.ca

A set partition is said to be (k, d)-noncrossing if it avoids the pattern 12

Toufik Mansour, Simone Severini

Real-time Traffic

DM 2008 | Explicit Formula | Ordinary Generating Function | Set Partition |

claim paper

Related Content

» On Trees and Noncrossing Partitions

» On the Number of Graphical Forest Partitions

» Integrals partitions and MacMahons Theorem

» Onedimensional optimal boundedshape partitions for Schur convex sum objective functions

» The Near Resolvable 213 4 3 Designs and ThirteenPlayer Whist Tournaments

» RanKloud a scalable ranked query processing framework on hadoop

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DM
Authors	Toufik Mansour, Simone Severini

Comments (0)