StandardTableauCountWithMajorIndexCongruentToOneModuloSize
The standard Young tableaux whose major index leaves remainder 1 on division by the size of the shape (never, when the size is 1).
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001440via IntegerPartition✓StandardTableauCountWithMajorIndexCongruentToOneModuloSize(partition)The standard Young tableaux whose major index leaves remainder 1 on division by the size of the shape (never, when the size is 1).Typed signatures
| Type | Package | Applies |
|---|---|---|
(integer_partition) -> number | combinatorics | always |
Details
- Defined over
IntegerPartitionas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
IntegerPartitionand 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 IntegerPartition, over _x
0 if Length(_x) < 1 else Apply((m: number) => Apply(
(q: list<integer>) => Sum(Map(
Function(q[i] if (i - 1 +
m) %
Sum(_x) ==
1 else 0, i),
Range(1, Sum(_x) *
(Sum(_x) + 1) /
2 +
1),
)),
Apply(
(c: list<integer>) => Fold(
Function(Map(
Function(Sum(Map(
Function(a[i -
t * b], t),
Range(0, (i - 1 -
(i - 1) %
b) /
b),
)), i),
Range(1, Sum(_x) *
(Sum(_x) + 1) /
2 +
1),
), a, b),
Fold(
Function(Map(
Function(a[i] -
a[i - b] if i > b else a[i], i),
Range(1, Sum(_x) *
(Sum(_x) + 1) /
2 +
1),
), a, b),
Map(
Function(1 if i == 1 else 0, i),
Range(1, Sum(_x) *
(Sum(_x) + 1) /
2 +
1),
),
Range(1, Sum(_x)),
),
Flatten(Map(
Function(Map(Function(_x[i] - j +
(c[j] - i) +
1, j), Range(1, _x[i])), i),
Range(1, Length(_x)),
)),
),
Map(
Function(Count(Filter(
Range(1, Length(_x)),
Function(_x[j] >= i, j),
)), i),
Range(
1,
Max(_x),
),
),
),
), Sum(Map(
Function((i - 1) *
_x[i], i),
Range(
1,
Length(_x),
),
)))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |