The r-derangement numbers

From MaRDI portal
Publication:526265

DOI10.1016/J.DISC.2016.10.012zbMATH Open1415.05007arXiv1803.04529OpenAlexW2553274030MaRDI QIDQ526265FDOQ526265

Piotr Miska, István Mező, Chenying Wang

Publication date: 10 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1803.04529




Recommendations




Cites Work


Cited In (35)

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)