In this paper, we introduce polynomials (in x) of signed relative derangements that track the number of signed elements. Note that relative derangements are those without any signed elements, i.e. the evaluations of the polynomials at x=0. Also, the numbers of all signed relative derangements are given by the evaluations at x=1. Then the coefficients of the polynomials connect unsigned and signed relative derangements and reveal how putting elements with signs affects the formation of derangements. We first prove a recurrence satisfied by these polynomials which results in a recurrence satisfied by the coefficients. A combinatorial proof of the latter is provided next. Thanks to the recurrence, we also show that the sequences of the coefficients are unimodal. Moreover, other results are obtained, for instance, a kind of dual of a relation between signed derangements and signed relative derangements previously proved by Chen and Zhang is presented.
Read full abstract