Abstract
AbstractGiven 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.
Publisher
Cambridge University Press (CUP)
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Derangement model of ligand-receptor binding;Computational and Mathematical Biophysics;2022-01-01
2. Multi-Radio Based Rendezvous Technique for Heterogeneous Cognitive Radio Sensor Network;Sensors;2021-04-24
3. Index;Encyclopedia of Special Functions: The Askey-Bateman Project;2020-09-30
4. Some Families of Matrix-Valued Jacobi Orthogonal Polynomials;Encyclopedia of Special Functions: The Askey-Bateman Project;2020-09-30
5. Matrix-Valued Orthogonal Polynomials and Differential Equations;Encyclopedia of Special Functions: The Askey-Bateman Project;2020-09-30