Number of k-length ordered arrangements of n distinct objects: P(n,k) = n! / (n-k)!.
Permutation P(n,k)
Related concepts
- Factorial n!
- Combination C(n,k) = nCr
- Robinson–Schensted–Knuth correspondence
- Pólya enumeration theorem
- Symmetric group S_n
- Coherent state |alpha> = e^{-|alpha|^2/2} sum alpha^n/sqrt(n!) |n>; permutation/factorial
- STDP: Δw = A₊ exp(-Δt/τ₊) for Δt>0 (LTP), -A₋ exp(Δt/τ₋) for Δt<0 (LTD)
- CIP (Cahn-Ingold-Prelog) priority: R/S from S₄-permutation parity
- CIP parity: cyclic σ=(0 1 2) sgn=+1 (S); transposition sgn=−1 (R)
- CIP stereodescriptor swap-parity framework: (−1)^N signature under transposition of ranked substituents
- Expanded genetic code
- Parasite immune evasion
- Genetic code
- Clonal-selection framework (Burnet 1957)
- Hox cluster collinearity (Lewis-Akam)