Enumeration of $(k,2)$-noncrossing partitions

Details Enumeration of $(k,2)$-noncrossing partitions Enumeration of $(k,2)$-noncrossing partitions

2008-08-08

arxiv.org/abs/0808.1157v1

Discrete Mathematics 308:20 (2008) 4570-4577

Mathematics

Combinatorics

9 pages, 1 table

Scientific paper

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$.

Affiliated with

Also associated with

No associations

Rating

Enumeration of $(k,2)$-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 Enumeration of $(k,2)$-noncrossing partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of $(k,2)$-noncrossing partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29315