RightOpenerSmaller
Pairs of an opener j and a larger element i of an earlier block.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000491via SetPartition✓RightOpenerSmaller(partition)Pairs of an opener j and a larger element i of an earlier block.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. - FindStat's ros (right, opener, smaller): an inversion of the set partition in Steingrímsson's sense.
Definition
Epsil, as the implementation runs it.
on SetPartition, over _x
0 if Length(_x) < 2 else Sum(Map(Function(Count(Filter(
Range(
1,
Length(Flatten(_x)),
),
Function(Sum(Map(
Function(
q if Contains(_x[q], i) else 0,
q,
),
Range(1, Length(_x)),
)) < k &&
i > _x[k][1], i),
)), k), Range(
1,
Length(_x),
)))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |