The largest singletons in weighted set partitions and its applications

Details The largest singletons in weighted set partitions and its applications The largest singletons in weighted set partitions and its applications

2010-07-08

arxiv.org/abs/1007.1336v1

Mathematics

Combinatorics

15pages

Scientific paper

Recently, Deutsch and Elizalde studied the largest and the smallest fixed points of permutations. Motivated by their work, we consider the analogous problems in weighted set partitions. Let $A_{n,k}(\mathbf{t})$ denote the total weight of partitions on $[n+1]$ with the largest singleton $\{k+1\}$. In this paper, explicit formulas for $A_{n,k}(\mathbf{t})$ and many combinatorial identities involving $A_{n,k}(\mathbf{t})$ are obtained by umbral operators and combinatorial methods. As applications, we investigate three special cases such as permutations, involutions and labeled forests. Particularly in the permutation case, we derive a surprising identity analogous to the Riordan identity related to tree enumerations, namely, \begin{eqnarray*} \sum_{k=0}^{n}\binom{n}{k}D_{k+1}(n+1)^{n-k} &=& n^{n+1}, \end{eqnarray*} where $D_{k}$ is the $k$-th derangement number or the number of permutations of $\{1,2,\dots, k\}$ with no fixed points.

Affiliated with

Also associated with

No associations

Rating

The largest singletons in weighted set partitions and its applications 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 The largest singletons in weighted set partitions and its applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The largest singletons in weighted set partitions and its applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102766