Charge
The charge of the reading word: the sum of n - e over the entries e whose successor is not in a lower row.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000009via StandardTableau✓Charge(tableau)The charge of the reading word: the sum of n - e over the entries e whose successor is not in a lower row.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 reading word lists the rows from the bottom up, so e + 1 is to the right of e exactly when its row is not lower. The charge of a standard word adds, for each e with e + 1 to its right, the n - e entries from e + 1 on.
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),
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 |