PermutationInversion
A name from the enumeratio catalogue with no kernel of its own yet; this page carries its crosswalk only.
Catalogued in the enumeratio database; not yet written up here.
Wikipedia
Lehmer codevia LehmerCodesOEISA000142via LehmerCodesSageMathsage.combinat.permutation.from_lehmer_codevia LehmerCodesPermutationInversion(...)Catalogued in the enumeratio database; not yet written up here.Typed signatures
| Type | Package | Applies |
|---|---|---|
(list<integer>) -> permutation_inversion | combinatorics | always |
Maps
Into and out of PermutationInversion, called as CombinatorialMap(x, "Name"). Properties are the laws we state and what FindStat records.
To PermutationInversion
- ToLehmerCodePermutation → PermutationInversionEntry i counts the later entries smaller than p(i).