Efficient Weighted Counting of Multiset Derangements
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913640301461504 |
|---|---|
| author | Ekhad, Shalosh B. Zeilberger, Doron |
| author_facet | Ekhad, Shalosh B. Zeilberger, Doron |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_04189 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient Weighted Counting of Multiset Derangements Ekhad, Shalosh B. Zeilberger, Doron Combinatorics 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. |
| title | Efficient Weighted Counting of Multiset Derangements |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2501.04189 |