UnsplittableFactorCount
The number of unsplittable factors of the set partition under the split product.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000823via SetPartition✓UnsplittableFactorCount(partition)The number of unsplittable factors of the set partition under the split product.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 St000823. The split product of set partitions of m and n glues the i-th block of the first to the i-th block of the second, shifted by m.
Definition
Epsil, as the implementation runs it.
on SetPartition, over _x
0 if Length(_x) < 1 else 1 if Length(Flatten(_x)) < 2 else 1 + Sum(Map(
Function(1 if Length(_x) < 2 else 1 if Max(Sum(Map(Function(1 if (_x[k][Max(Sum(Map(Function(1 if _x[k][j] <= m else 0, j), Range(1, Length(_x[k])))), 0) +
1] if Last(_x[k]) > m else Length(Flatten(_x)) + 1) >
(_x[k + 1][Max(Sum(Map(
Function(1 if _x[k + 1][j] <=
m else 0, j),
Range(1, Length(_x[k + 1])),
)), 0) +
1] if Last(_x[k + 1]) >
m else Length(Flatten(_x)) + 1) else 0, k), Range(1, Length(_x) - 1, 1))), 0) ==
0 else 0, m),
Range(
1,
Length(Flatten(_x)) -
1,
1,
),
))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |