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.
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
In combinatorial mathematics, ...... les meet again just by chance.
@en
In der Kombinatorik versteht m ...... nem bisherigen Platz bleibt: .
@de
В комбинаторной математике под ...... чаях 2 пары окажутся прежними.
@ru
Wikipage page ID
Wikipage revision ID
740,767,036
title
Partial Derangements
urlname
PartialDerangement
subject
hypernym
type
comment
In combinatorial mathematics, ...... t have exactly k fixed points.
@en
In der Kombinatorik versteht m ...... nem bisherigen Platz bleibt: .
@de
В комбинаторной математике под ...... вших положение в перестановке.
@ru
label
Rencontres numbers
@en
Rencontres-Zahl
@de
Число встреч (комбинаторика)
@ru