On the combinatorics of derangements and related permutations

Jie Zhang, Daniel Gray, Hua Wang and Xiao-Dong Zhang

Applied Mathematics and Computation, 2022, vol. 431, issue C

Abstract: A derangement is a permutation in which no entry is at its original position. The number of derangements of [n] is called the “derangement number” or “de Montmort number”, and is denoted by Dn. The sequence {Dn} enumerates, in addition to the number of derangements, many other permutations under various constraints. In this paper, we explore the connections between these combinatorial objects and provide bijective proofs. Some related enumerative problems are also mentioned.

Keywords: Derangement; Permutation; Bijection (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322004155
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:431:y:2022:i:c:s0096300322004155

DOI: 10.1016/j.amc.2022.127341

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().