Set partitions with no m-nesting

Details Set partitions with no m-nesting Set partitions with no m-nesting

2011-06-24

arxiv.org/abs/1106.5036v2

Mathematics

Combinatorics

Scientific paper

A partition on [n] has an m-nesting if there exists i_1 < i_2 < ... < i_m < j_m < j_{m-1} < ... < j_1, where i_l and j_l are in the same block for all 1 <= l <= m. We use generating trees to construct the class of partitions with no m-nesting and determine functional equations satisfied by the associated generating functions. We use algebraic kernel method together with a linear operator to describe a coefficient extraction process. This gives rise to enumerative data, and illustrates the increasing complexity of the coefficient formulas as m increases.

Affiliated with

Also associated with

No associations

Rating

Set partitions with no m-nesting 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 Set partitions with no m-nesting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Set partitions with no m-nesting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-394527