OccurrencesOf1Over2Over3Openers3Closers12
Occurrences of the pattern 1/2/3 with 3 the least element of its block and 1 and 2 the greatest elements of their blocks.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000583via SetPartition✓OccurrencesOf1Over2Over3Openers3Closers12(partition)Occurrences of the pattern 1/2/3 with 3 the least element of its block and 1 and 2 the greatest elements of their blocks.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.
Definition
Epsil, as the implementation runs it.
on SetPartition, over _x
0 if Length(Flatten(_x)) < 3 else Sum(Map(
Function(Sum(Map(
Function(Count(Filter(
Range(b + 1, Length(Flatten(_x))),
Function(Abs(Sum(Map(
Function(q if Contains(_x[q], a) else 0, q),
Range(1, Length(_x)),
)) -
Sum(Map(
Function(q if Contains(_x[q], b) else 0, q),
Range(1, Length(_x)),
))) >
0 &&
Abs(Sum(Map(
Function(q if Contains(_x[q], a) else 0, q),
Range(1, Length(_x)),
)) -
Sum(Map(
Function(q if Contains(_x[q], c) else 0, q),
Range(1, Length(_x)),
))) >
0 &&
Abs(Sum(Map(
Function(q if Contains(_x[q], b) else 0, q),
Range(1, Length(_x)),
)) -
Sum(Map(
Function(q if Contains(_x[q], c) else 0, q),
Range(1, Length(_x)),
))) >
0 &&
Contains(Map(Function(b[1], b), _x), c) &&
Contains(Map(Function(Last(b), b), _x), a) &&
Contains(Map(Function(Last(b), b), _x), b), c),
)), b),
Range(
a + 1,
Length(Flatten(_x)) -
1,
),
)), a),
Range(1, Length(Flatten(_x)) - 2),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |