Rencontres numbers
In combinatorial mathematics, the rencontres numbers are a triangular array of integers that enumerate permutations of the set { 1, ..., n } with specified numbers of fixed points: in other words, partial derangements. (Rencontre is French for encounter. By some accounts, the problem is named after a solitaire game.) For n ≥ 0 and 0 ≤ k ≤ n, the rencontres number Dn, k is the number of permutations of { 1, ..., n } that have exactly k fixed points.
Cycles and fixed pointsDerangementDiscrete uniform distributionIndex of combinatorics articlesLatin rectangleList of permutation topicsList of statistics articlesList of triangle topicsPartial derangementPermutationProbleme des rencontresProblème des rencontresRandom permutation statisticsRencontres NumbersRencontres numberRook polynomialSchuette–Nesbitt formulaSymmetric group
Link from a Wikipage to another Wikipage
primaryTopic
Rencontres numbers
In combinatorial mathematics, the rencontres numbers are a triangular array of integers that enumerate permutations of the set { 1, ..., n } with specified numbers of fixed points: in other words, partial derangements. (Rencontre is French for encounter. By some accounts, the problem is named after a solitaire game.) For n ≥ 0 and 0 ≤ k ≤ n, the rencontres number Dn, k is the number of permutations of { 1, ..., n } that have exactly k fixed points.
has abstract
En combinatoire, le nombre de ...... ngements partiels d'ordre n-k.
@fr
In combinatorial mathematics, ...... couples meet again by chance.
@en
In der Kombinatorik versteht m ...... nem bisherigen Platz bleibt: .
@de
В комбинаторной математике под ...... чаях 2 пары окажутся прежними.
@ru
В комбінаторній математиці під ...... , що рівно 2 пари повторяться.
@uk
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
974,870,953
Link from a Wikipage to another Wikipage
title
Partial Derangements
@en
urlname
PartialDerangement
@en
wikiPageUsesTemplate
subject
hypernym
type
comment
En combinatoire, le nombre de ...... ngements partiels d'ordre n-k.
@fr
In combinatorial mathematics, ...... t have exactly k fixed points.
@en
In der Kombinatorik versteht m ...... nem bisherigen Platz bleibt: .
@de
В комбинаторной математике под ...... вших положение в перестановке.
@ru
В комбінаторній математиці під ...... нили положення в перестановці.
@uk
label
Dérangement partiel
@fr
Rencontres numbers
@en
Rencontres-Zahl
@de
Число встреч (комбинаторика)
@ru
Число зустрічей (комбінаторика)
@uk