MonotoneHurwitzNumber
The monotone factorizations of genus zero of a permutation of this cycle type into transpositions: the product of the Catalan numbers C(p - 1) over the parts p.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St001934via IntegerPartition✓MonotoneHurwitzNumber(partition)The monotone factorizations of genus zero of a permutation of this cycle type into transpositions: the product of the Catalan numbers C(p - 1) over the parts p.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. - The cycles factor independently, and the larger entries of the transpositions, weakly increasing, fix how the factors interleave.
Definition
Epsil, as the implementation runs it.
on IntegerPartition, over _x
1 if Length(_x) < 1 else Apply(
(c: list<integer>) => Product(Map(
Function(
c[_x[i]],
i,
),
Range(
1,
Length(_x),
),
)),
Fold(Function(Join(
a,
[Sum(Map(
Function(a[i] *
a[Length(a) -
(i - 1)], i),
Range(
1,
Length(a),
),
))],
), a, b), [1], Range(
1,
Max(_x),
)),
)Examples
Properties #
About
| Examples | 5 |
|---|---|
| Crosswalk | FindStat |