Some identities on derangement and degenerate derangement polynomials

Preprint
Publisher Website
Google Scholar
Abstract
In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate versions of the companions we introduce derangement polynomials and degenerate derangement polynomials. We give some of their properties, recurrence relations and identities for those polynomials which are related to some special numbers and polynomials.
All Related Versions

This publication has 0 references indexed in Scilit: