HuangRhoadesMajorIndex
The major index of the flattened permutation, plus for each block ending before the next begins the elements so far beyond each block's first.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000747via SetPartition✓HuangRhoadesMajorIndex(partition)The major index of the flattened permutation, plus for each block ending before the next begins the elements so far beyond each block's first.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. - Huang and Rhoades' variant (Ordered set partitions and the 0-Hecke algebra, eq. 2.7).
Definition
Epsil, as the implementation runs it.
on SetPartition, over _x
(0 if Length(Flatten(_x)) < 2 else Sum(Map(
Function(i if Flatten(_x)[i] >
Flatten(_x)[i + 1] else 0, i),
Range(1, Length(Flatten(_x)) - 1),
))) +
(0 if Length(_x) < 2 else Sum(Map(
Function(
Sum(Map(
Function(
Length(_x[t]) -
1 if t <= i else 0,
t,
),
Range(1, Length(_x)),
)) if Last(_x[i]) <
_x[i + 1][1] else 0,
i,
),
Range(1, Length(_x) - 1),
)))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |