$λ$-factorials of $n$

Details $λ$-factorials of $n$ $λ$-factorials of $n$

2010-07-08

arxiv.org/abs/1007.1339v1

Mathematics

Combinatorics

13pages

Scientific paper

Recently, by the Riordan's identity related to tree enumerations, \begin{eqnarray*} \sum_{k=0}^{n}\binom{n}{k}(k+1)!(n+1)^{n-k} &=& (n+1)^{n+1}, \end{eqnarray*} Sun and Xu derived another analogous one, \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 number of permutations with no fixed points on $\{1,2,\dots, k\}$. In the paper, we utilize the $\lambda$-factorials of $n$, defined by Eriksen, Freij and W$\ddot{a}$stlund, to give a unified generalization of these two identities. We provide for it a combinatorial proof by the functional digraph theory and another two algebraic proofs. Using the umbral representation of our generalized identity and the Abel's binomial formula, we deduce several properties for $\lambda$-factorials of $n$ and establish the curious relations between the generating functions of general and exponential types for any sequence of numbers or polynomials.

Affiliated with

Also associated with

No associations

Rating

$λ$-factorials of $n$ 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 $λ$-factorials of $n$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and $λ$-factorials of $n$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102782