Live briefing
Everything about Lehmer code
Scheme for numbering permutations
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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Lehmer codeA 5-minute orientation
- Skim a recent paper: Theoretical and Empirical Analysis of Lehmer Codes to Search Permutation Spaces with Evolutionary AlgorithmsInfluential work since 2022
- Read the landmark paper: Teaching Ordinal Patterns to a Computer: Efficient Encoding Algorithms Based on the Lehmer CodeCited 27 times
- Go sideways: PermutationA closely related topic
- Go sideways: Inversion (discrete mathematics)A closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Teaching Ordinal Patterns to a Computer: Efficient Encoding Algorithms Based on the Lehmer Code
Lehmer code transforms and Mahonian statistics on permutations
A Consecutive Lehmer Code for Parabolic Quotients of the Symmetric Group
🆕 Influential since 2022
đź“š Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- Permutation In mathematics, a permutation is a bijective function of a finite set onto itself. When the set is represented as an ordered sequence of its members, a…
- Inversion (discrete mathematics) In computer science and discrete mathematics, an inversion in a sequence is a pair of elements that are out of their natural order. Let π be a permutation…
- Parity of a permutation In mathematics, when X is a finite set with at least two elements, the permutations of X (that is, the bijective functions from X to itself) fall into…
- Lucas–Lehmer primality test In mathematics, the Lucas–Lehmer test (LLT) is a primality test for Mersenne numbers. The test was originally developed by Édouard Lucas in 1878 and subsequentl…
- Factorial number system In combinatorics, the factorial number system (also known as factoradic), is a mixed radix numeral system adapted to numbering permutations. It is also…
- Pauli matrices In mathematical physics and mathematics, the Pauli matrices are a set of three 2×2 complex matrices that are traceless, Hermitian, involutory and unitary…
- Cyclic permutation In mathematics, and in particular in group theory, a cyclic permutation is a permutation consisting of a single cycle. In some cases, cyclic permutations…
- Steinhaus–Johnson–Trotter algorithm The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M.…