MahonianWordInversions
Inversions of the Mahonian word.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001841via SetPartition✓MahonianWordInversions(partition)Inversions of the Mahonian word.Typed signatures
| Type | Package | Applies |
|---|---|---|
(set_partition) -> number | combinatorics | always |
Details
- Defined over
SetPartitionas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
SetPartitionand nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer.
Definition
Epsil, as the implementation runs it.
on SetPartition, over _x
0 if Length(Flatten(_x)) < 2 else Sum(Map(Function(Count(Filter(
Range(
i + 1,
Length(Flatten(_x)),
),
Function(Count(Filter(
Map(Function(Last(b), b), _x),
Function(c <
Sum(Map(
Function(Last(_x[q]) if Contains(_x[q], i) else 0, q),
Range(1, Length(_x)),
)), c),
)) >
Count(Filter(
Map(Function(Last(b), b), _x),
Function(c <
Sum(Map(
Function(Last(_x[q]) if Contains(_x[q], j) else 0, q),
Range(1, Length(_x)),
)), c),
)), j),
)), i), Range(
1,
Length(Flatten(_x)) -
1,
)))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |