Given a set consisting of n1, objects of type 1, n2 of type 2, …, nk of type k, we denote by the number of possible derangements of the set i.e. permutations in which no object occupies a site originally occupied by an object of the same type. A formula is found for in terms of Laguerre polynomials, and some of its implications are considered.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.
* Views captured on Cambridge Core between September 2016 - 23rd August 2017. This data will be updated every 24 hours.