InversionsOfDistanceAtMostTwo
Inversions i < j with j - i <= 2.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000495via Permutation✓InversionsOfDistanceAtMostTwo(p)Inversions i < j with j - i <= 2.Typed signatures
| Type | Package | Applies |
|---|---|---|
(list<integer> | permutation) -> number | combinatorics | always |
Details
- Defined over
Permutationas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
Permutation, and also a bare list of integers: this reading compares entries with each other rather than with their positions, so it stands on any sequence.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 2 else Sum(Map(Function(Sum(Map(
Function(1, j),
Filter(
Range(
i + 1,
Length(_x),
),
Function(_x[i] >
_x[j] && j - i <=
2, j),
),
)), i), Range(1, Length(_x) - 1)))Examples
Basic #
Properties #
About
| Examples | 6 |
|---|---|
| Crosswalk | FindStat |