ShiftedNaturalComajorIndex
The sum of n - e over the natural descents e, plus the sum of (r - 1) times the length of row r.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001697via StandardTableau✓ShiftedNaturalComajorIndex(tableau)The sum of n - e over the natural descents e, plus the sum of (r - 1) times the length of row r.Typed signatures
| Type | Package | Applies |
|---|---|---|
(standard_tableau) -> number | combinatorics | always |
Details
- Defined over
StandardTableauas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
StandardTableauand 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. - The natural comajor index shifted by the weighted size of the shape (FindStat's St001697). A tableau of fewer than two entries has no natural descent and a weighted size of 0.
Definition
Epsil, as the implementation runs it.
on StandardTableau, over _x
0 if Length(Flatten(_x)) < 2 else Apply((reading: list<integer>) => Apply(
(lengths: list<integer>) => Apply(
(rowIds: list<integer>) => Max(Sum(Map(
Function(Length(reading) - e if rowIds[IndexOf(reading, e + 1)] <
rowIds[IndexOf(reading, e)] else 0, e),
Range(1, Length(reading) - 1, 1),
)), 0) +
Max(Sum(Map(Function((i - 1) *
lengths[i], i), Range(1, Length(_x)))), 0),
Flatten(Map(
Function(Map(Function(i, j), Range(1, lengths[i], 1)), i),
Range(1, Length(_x)),
)),
),
Map(
Function(Length(r), r),
_x,
),
), Flatten(_x))Examples
Properties #
About
| Examples | 4 |
|---|---|
| Crosswalk | FindStat |