Lehmer code: Difference between revisions

Revision as of 13:40, 16 October 2017

Revision as of 13:43, 16 October 2017

Line 1:

{{contradict-other-multiple|Permutation|Factorial number system|date=October 2011}}

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 table'''.