Some Identities Involving Derangement Polynomials and Numbers and Moments of Gamma Random Variables
The problem of counting derangements was initiated by Pierre Rémond de Montmort in 1708. A derangement is a permutation that has no fixed points, and the derangement number D n is the number of fixed point free permutations on an n element set. Furthermore, the derangement polynomials are natural extensions of the derangement numbers. In this paper, we study the derangement polynomials and numbers, their connections with cosine-derangement polynomials and sine-derangement polynomials, and their applications to moments of some variants of gamma random variables.
2002 ◽
Vol 34
(2)
◽
pp. 441-468
◽
2002 ◽
Vol 34
(02)
◽
pp. 441-468
◽
Fixed points of a generalized smoothing transformation and applications to the branching random walk
1998 ◽
Vol 30
(01)
◽
pp. 85-112
◽
Fixed points of a generalized smoothing transformation and applications to the branching random walk
1998 ◽
Vol 30
(1)
◽
pp. 85-112
◽
Keyword(s):
2010 ◽
Vol 25
(24)
◽
pp. 4603-4621
◽
Keyword(s):
2005 ◽
Vol 2005
(19)
◽
pp. 3045-3055
◽