Ontology Browser
›
combinatorics
› Permutation P(n,k)
Permutation P(n,k)
Layer 0 — Mathematics
in the
combinatorics
subtree
Number of k-length ordered arrangements of n distinct objects: P(n,k) = n! / (n-k)!.
Related concepts
Factorial n!
Combination C(n,k) = nCr
Robinson–Schensted–Knuth correspondence
Pólya enumeration theorem
Symmetric group S_n
CIP (Cahn-Ingold-Prelog) priority: R/S from S₄-permutation parity
CIP parity: cyclic σ=(0 1 2) sgn=+1 (S); transposition sgn=−1 (R)
Explore Permutation P(n,k) on the interactive knowledge graph →