Efficient weighted counting of multiset derangements

Abstract We use the Almkvist–Zeilberger algorithm, combined with a weighted version of the Even–Gillis Laguerre integral due to Foata and Zeilberger, in order to efficiently compute weight enumerators of multiset derangements according to the number of cycles. The present paper is inspired by important previous work by Mourad Ismail and his collaborators, done in the late 1970s, but still useful after all these years.