-factorials of n

From MaRDI portal
Publication:612957

zbMATH Open1204.05008arXiv1007.1339MaRDI QIDQ612957FDOQ612957


Authors: Yidong Sun, Jujuan Zhuang Edit this on Wikidata


Publication date: 16 December 2010

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

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 Dk 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 Wddotastlund, 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.


Full work available at URL: https://arxiv.org/abs/1007.1339

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



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)