-factorials of n

Publication date 16 December 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.1339, https://eudml.org/doc/227089, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r169.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

\(\lambda \)-factorial of \(n\)Bell polynomial charlier polynomial derangement Hermite polynomial

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19) Umbral calculus (05A40) Trees (05C05)

Abstract: Recently, by the Riordan's identity related to tree enumerations, �egin{eqnarray*} sum_{k=0}^{n}�inom{n}{k}(k+1)!(n+1)^{n-k} &=& (n+1)^{n+1}, end{eqnarray*} Sun and Xu derived another analogous one, �egin{eqnarray*} sum_{k=0}^{n}�inom{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, d o t s, k

. In the paper, we utilize the

l a m b d a

-factorials of

n

, defined by Eriksen, Freij and W

d d o t 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

l a m b d a

-factorials of

n

and establish the curious relations between the generating functions of general and exponential types for any sequence of numbers or polynomials.

Review text

Summary: Recently, by the Riordan identity related to tree enumerations, \[ \sum_{k=0}^n \binom nk (k+1)!(n+1)^{n-k}= (n+1)^{n+1}, \] Sun and Xu have derived another analogous one, \[ \sum_{k=0}^n \binom nk D_{k+1}(n+1)^{n-k}= n^{n+1}, \] 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\), denned by Eriksen, Freij and Wästlund, to give a unified generalization of these two identities. We provide for it a combinatorial proof by the functional digraph theory and two algebraic proofs. Using the umbral representation of our generalized identity and Abel's binomial formula, we deduce several properties for \(\lambda\)-factorials of \(n\) and establish interesting relations between the generating functions of general and exponential types for any sequence of numbers or polynomials.

Recommendations

Cited in

(4)

This page was built for publication: \(\lambda \)-factorials of \(n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612957)