The r-derangement numbers

From MaRDI portal
(Redirected from Publication:526265)
The \(r\)-derangement numbers




Abstract: The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition. We find exact formula, combinatorial relations for these numbers as well as analytic and asymptotic description. Moreover, we study deeper number theoretical properties, like modularity, p-adic valuations, and diophantine problems.




Cited in
(40)


Describes a project that uses

Uses Software






This page was built for publication: The \(r\)-derangement numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526265)