Lehmer code: Difference between revisions

Revision as of 06:56, 11 October 2024

Latest revision as of 04:02, 8 August 2025

(4 intermediate revisions by 4 users not shown)

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.

Line 71 ⟶ 72:

==Similar concepts==

TwoSeveral similarrelated vectorsconstructions arehave inalso been put into use. One of them is often called inversion vector, e.g. by [[Wolfram Alpha]].

Two similar vectors are in use. One of them is often called inversion vector, e.g. by [[Wolfram Alpha]].

See also {{Section link|Inversion_(discrete_mathematics)|Inversion related vectors}}.

Line 83:

| last=Lehmer

| first=D.H.

| title=Combinatorial Analysis

| titlechapter=Teaching combinatorial tricks to a computer

| series=Proceedings of Symposia in Applied Mathematics

| author-link=D. H. Lehmer

| title=Teaching combinatorial tricks to a computer

| journal=Proc. Sympos. Appl. Math. Combinatorial Analysis, Amer. Math. Soc.

| volume=10

| year=1960

| pages=179–193

| doi=10.1090/psapm/010/0113289

| isbn=978-0-8218-1310-2

| mr=0113289

}}

Line 99 ⟶ 101:

| last=Laisant

| first=Charles-Ange

| author-link= Charles-Ange Laisant

| title=Sur la numération factorielle, application aux permutations

| trans-title=On factorial numbering, application to permutations