StarTranspositionFactorizationCount
Minimal transitive factorizations of a permutation of this cycle type into star transpositions: the product of the parts times (n + 1) ... (n + length - 2).
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001936via IntegerPartition✓StarTranspositionFactorizationCount(partition)The minimal transitive factorizations of a permutation of this cycle type into star transpositions: the product of the parts times (n + 1)...(n + length - 2).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
1 if Length(_x) < 1 else 1 if Length(_x) == 1 else Product(_x) * (1 if Length(_x) ==
2 else Product(Range(
Sum(_x) + 1,
Sum(_x) + Length(_x) -
2,
)))Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |