Lehmer code: Difference between revisions

Revision as of 12:57, 12 October 2018

Revision as of 17:57, 11 June 2019

Line 1:

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

The Lehmer code is named in reference to [[Derrick Henry Lehmer]],<ref name="lehmer"/> but the code had been known since 1888 at least.<ref name="lehmer"/><ref name="laisant"/>

==The code==