Content deleted Content added
Adding short description: "Scheme for numbering permutations" |
|||
Line 1:
{{Short description|Scheme for numbering permutations}}
In [[mathematics]] and in particular in [[combinatorics]], the '''Lehmer code''' is a particular way to [[encoding|encode]] each possible [[permutation]] of a sequence of ''n'' numbers. It is an instance of a scheme for [[Permutation#Numbering permutations|numbering permutations]] and is an example of an [[inversion (discrete mathematics)|inversion]] table.
| |||