Thumbnail
Access Restriction
Open

Author Mansour, Toufik ♦ Severini, Simone
Source arXiv.org
Content type Text
File Format PDF
Date of Submission 2008-08-08
Language English
Subject Domain (in DDC) Natural sciences & mathematics ♦ Mathematics
Subject Keyword Mathematics - Combinatorics ♦ 05A05 ♦ 05A15 ♦ math
Abstract A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.
Description Reference: Discrete Mathematics 308:20 (2008) 4570-4577
Educational Use Research
Learning Resource Type Article
Page Count 9


Open content in new tab

   Open content in new tab