Enumeration of connected Catalan objects by type

Details Enumeration of connected Catalan objects by type Enumeration of connected Catalan objects by type

2010-05-14

arxiv.org/abs/1005.2553v1

Mathematics

Combinatorics

Scientific paper

Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We define a notion of `connectivity' for these objects and prove an analogous product formula which counts connected objects by type. Our proof of this product formula is combinatorial and bijective. We extend this to a product formula which counts objects with a fixed type and number of connected components. We relate our product formulas to symmetric functions arising from parking functions. We close by presenting an alternative proof of our product formulas communicated to us by Christian Krattenthaler which uses generating functions and Lagrange inversion.

Affiliated with

Also associated with

No associations

Rating

Enumeration of connected Catalan objects by type 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 connected Catalan objects by type, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of connected Catalan objects by type will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-520053