NormalizedLeafLabelSum
The sum of the leaf labels of the increasing binary tree of p, less n.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000726via Permutation✓NormalizedLeafLabelSum(p)The sum of the leaf labels of the increasing binary tree of p, less n.Typed signatures
| Type | Package | Applies |
|---|---|---|
(list<integer> | permutation) -> number | combinatorics | always |
Details
- Defined over
Permutationas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
Permutation, and also a bare list of integers: this reading compares entries with each other rather than with their positions, so it stands on any sequence.
Definition
Epsil, as the implementation runs it.
on Permutation, over _x
0 if Length(_x) < 1 else Max(Sum(Map(
Function(_x[i], i),
Filter(
Range(1, Length(_x)),
Function((_x[i - 1] < _x[i] if i >
1 else True) &&
(_x[i] > _x[i + 1] if i <
Length(_x) else True), i),
),
)), 0) - Length(_x)Examples
Basic #
Properties #
About
| Examples | 6 |
|---|---|
| Crosswalk | FindStat |