Efficient Weighted Counting of Multiset Derangements

By Shalosh B. Ekhad and Doron Zeilberger


.pdf    .tex      journal version   

First written : Jan. 7, 2025; This version: Jan. 26, 2025

Dedicated to Mourad E.-H.Ismail (b. April 27, 1944) on his 80th birthday, with friendship and admiration

[ Appeared (Arab. J. Math. (2025). https://doi.org/10.1007/s40065-025-00524-0) in the Arabian Journal of Mathematics (Speical issue in honor of Mourad Ismail, guest-edited by Erik Koelink and Mahmoud Annaby)]
On-line before print (volume and page tbd)


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.


[Acknowledgment: The authors wish to thank guest-editor Erik Koelink for help in dealing with the journal)]

Maple package


Sample Input and Output for Mourad.txt


Articles of Doron Zeilberger

Doron Zeilberger's Home Page