Square Partitions and Catalan Numbers

Details Square Partitions and Catalan Numbers Square Partitions and Catalan Numbers

2009-12-25

arxiv.org/abs/0912.4983v1

Mathematics

Representation Theory

Scientific paper

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e $\lambda=\lambda_1\ge...\ge\lambda_k>0$, and $\lambda_1=k,\lambda_k=1$, then applying the algorithm $\ell$ times gives rise to a set whose cardinality is either the Catalan number $c_{\ell-k+1}$ (the self dual case) or twice the Catalan number. The algorithm defines a tree and we study the propagation of the tree, which is not in the isomorphism class of the usual Catalan tree. The algorithm can also be modified to produce a two--parameter family of sets and the resulting cardinalities of the sets are the ballot numbers. Finally, we give a conjecture on the rank of a particular module for the ring of symmetric functions in $2\ell+m$ variables.

Affiliated with

Also associated with

No associations

Rating

Square Partitions and Catalan Numbers 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 Square Partitions and Catalan Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Square Partitions and Catalan Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-122158