Lehmer code
Lehmer code is a scheme for numbering permutations.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 19, 2026 · revision 2389208563
- Described as
- scheme for numbering permutations
- What it is
- mathematical concept
- Wikipedias with a page
- 4
Wikidata item Q2981462 (wikidata.org/wiki/Q2981462), public domain (CC0). Copied 2026-11-19.
What Wikipedia says · copied November 19, 2026 · revision 1310732422
In mathematics and in particular in combinatorics, the Lehmer code is a particular way to encode each possible permutation of a sequence of n numbers. It is an instance of a scheme for numbering permutations and is an example of an inversion table.
The Lehmer code is named in reference to D. H. Lehmer, but the code had been known since 1888 at least.
From the Wikipedia article “Lehmer code” (en.wikipedia.org/wiki/Lehmer_code), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-19; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
